b_{1})$
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
A Reconfigurable Computing In-Memory Macro with Charge-sharing-based Weighted Accumulator
Announce Type: new Abstract: SRAM-based analog computing-in-memory demonstrates outstanding efficiency. However, it faces three critical challenges: significant ADC overhead, high latency for multi-bit inputs, and limited read bitline voltage. To address these issues, this work proposes a multi-bit highly reconfigurable 256x128 in-memory computing array supporting 1-7b input, 2-4b weight, and 1-7b output.
Normalization Equivariance for Arbitrary Backbones, with Application to Image Denoising
arXiv:2605.08193v3 Announce Type: replace Abstract: Normalization Equivariance (NE) is a structural prior that improves robustness to distribution shift in image-to-image tasks. A function $f$ is normalization equivariant iff $f(a y + b\mathbf{1}) = a f(y) + b\mathbf{1}$ for all $a>0$ and $b\in\mathbb{R}$. Existing NE methods constrain every internal layer to NE-compatible operations. These constraints add runtime cost and exclude standard transformer components such as softmax attention and...
Ultrafast machine learning on FPGAs via Kolmogorov-Arnold Networks
Ultrafast machine learning on FPGAs via Kolmogorov-Arnold Networks This post is a high-level explainer for my Master’s thesis, which involves designing hardware architectures for ultrafast inference and online learning using the Kolmogorov-Arnold Network (KAN) architecture. I’ll assume familiarity with standard machine learning concepts, as well as some understanding of hardware and digital circuits; read my previous post here for the latter. Please read the two papers below for more...
Bit-counting complexity classes
arXiv:2606.04406v1 Announce Type: new Abstract: We define a new family of complexity classes called bit-counting complexity classes, since membership depends not merely on the number of accepting paths, but also on the binary profile of that number. We study the relationship between this new family of complexity classes and the classical complexity classes. We prove that the classical complexity class ${\bf PP}$ is contained in our comparison based bit-counting complexity classes ${\bf...
An Effective Pauli-Channel Model for Passive-User Loop-Back QKD
arXiv:2606.04247v1 Announce Type: new Abstract: This work develops an effective channel model for distributed passive-user Loop-Back quantum key distribution. In the intended key-establishment setting, the two passive users \(B_1\) and \(B_2\) are the legitimate lightweight parties that establish a shared secret key by using Alice as an active quantum preparation-and-measurement infrastructure. A single active station prepares and measures BB84 states, while two remote users apply only local...
Revenue Guarantees of No-Swap-Regret Dynamics in First Price Auctions
arXiv:2606.06085v1 Announce Type: new Abstract: We study the revenue of approximate correlated equilibrium in discrete first price auctions - the set of allowable bids is $\mathcal{B} = \{0, 1/k, \dots, 1 - 1/k, 1\}$ for some $k \in \mathbb{N}$. We show that the revenue of any $\epsilon$-approximate correlated equilibrium is at least $v_2 - \Theta(1/k)- \Theta(\epsilon k^2)$, where $v_2 \geq 0$ is the second-highest valuation. Our results establish the first polynomial convergence rates on...
Ionization energies for Rydberg $^4 \mathrm{He}$ ($1snp\,^{1,3}P$) states using the correlated B-spline basis function method
Announce Type: new Abstract: We extend the correlated B-spline basis function (C-BSBF) method to high-precision calculations of the ionization energies of helium Rydberg $n^{1,3}P$ states ($n=24$--$35$). Using a unified basis set, we evaluate nonrelativistic energies, relativistic corrections of order $m\alpha^4$ (including finite-mass recoil), QED contributions of order $m\alpha^5$, and partial $m\alpha^6$ terms (singlet-triplet mixing, one- and two-loop radiative corrections). The...
Ionization energies for Rydberg $^4 \mathrm{He}$ ($1snp\,^{1,3}P$) states using the correlated B-spline basis function method
arXiv:2606.04768v2 Announce Type: replace Abstract: We extend the correlated B-spline basis function (C-BSBF) method to high-precision calculations of the ionization energies of helium Rydberg $n^{1,3}P$ states ($n=24$--$35$). Using a unified basis set, we evaluate nonrelativistic energies, relativistic corrections of order $m\alpha^4$ (including finite-mass recoil), QED contributions of order $m\alpha^5$, and partial $m\alpha^6$ terms (singlet-triplet mixing, one- and two-loop radiative...
Approximation and learning of anisotropic and mixed smooth functions by deep ReLU neural networks
Announce Type: cross Abstract: This paper studies how efficiently deep ReLU neural networks can approximate and learn smooth functions. When the error is measured in $L^p([0,1]^d)$ norm and the approximator is a network with width $W$ and depth $L$, recent works have proven the supper approximation rate $\mathcal{O}((WL)^{-2s/d})$ for Besov space $\mathcal{B}^s_{q,r}([0,1]^d)$ under the Sobolev embedding condition $s/d>1/q-1/p$. In order to overcome the curse of dimensionality in this rate,...
Faster algorithms for k-Orthogonal Vectors in low dimension
Announce Type: replace Abstract: In the Orthogonal Vectors problem (OV), we are given two families $A, B$ of subsets of $\{1,\ldots,d\}$, each of size $n$, and the task is to decide whether there exists a pair $a \in A$ and $b \in B$ such that $a \cap b = \emptyset$. Straightforward algorithms for this problem run in $\mathcal{O}(n^2 \cdot d)$ or $\mathcal{O}(2^d \cdot n)$ time, and assuming SETH, there is no $2^{o(d)}\cdot n^{2-\varepsilon}$ time algorithm that solves this problem for any...