\Theta(\sqrt{d})$
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Rectangular Matrix Multiplication in the Low-Bandwidth Model
arXiv:2606.04652v1 Announce Type: new Abstract: We study rectangular matrix multiplication in the low-bandwidth model of distributed computing. There are $n$ computers; initially the input matrices are distributed evenly between computers, and in each communication round every computer can send and receive an $O(\log n)$-bit message. Eventually each computer must output its designated part of the product matrix.
Batched Stochastic Linear Bandits with 1-Bit Communication Constraints
Announce Type: cross Abstract: We study stochastic linear bandits under a natural combination of batching and communication constraints: the time horizon is partitioned into batches of equal size $B$, and during each batch the learner sends $B$ requested arm pulls to an agent, who then observes the corresponding $B$ rewards and responds with a single bit of feedback to the learner. For each batch, the learner specifies the 1-bit quantization rule the agent uses, which may depend on all...
How Deep Are Deep GPs, Really? A Sharp Threshold and a Non-Gaussian Limit for Compositional GPs
arXiv:2606.08218v1 Announce Type: new Abstract: Compositional priors describe the generic properties of layered functions in deep Bayesian models, where deep neural networks with random weights are a canonical example. In the wide-network limit, the prior is a Gaussian process with a depth-dependent kernel, and its behaviour as depth grows has been extensively studied through this kernel. Here, we study another case, where each layer itself is a vector valued Gaussian process, and our aim is...
Coherent Swap Regret and Channel-Proof Learning
arXiv:2606.02655v1 Announce Type: cross Abstract: External regret certifies stability only against replacing one's behavior by a fixed alternative. In a quantum game, this misses a natural physical move: a player can apply a local completely positive trace-preserving (CPTP) map to the state it actually received or prepared.
Layerwise Terminal Discrepancy in Chen's Reverse-Heat Coupling on the Boolean Cube
arXiv:2606.04573v1 Announce Type: cross Abstract: We isolate a layerwise refinement of the terminal testing-discrepancy step in Chen's perturbed reverse-heat approach~\cite{Chen2026} to Talagrand's convolution conjecture on the Boolean cube. Built on the joint-filtration martingale formulation of Chen's coupling, and on Chen's approximate monotonicity and conditional squared-score estimates being available in the joint-filtration form stated below, we prove the localized testing estimate \[...
Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection
arXiv:2604.22900v2 Announce Type: replace Abstract: We extend the CDPR's quantum attack from ideal lattices to module lattices over $2^k$-th cyclotomic rings. Using trace orthogonality of the power basis, we decompose a rank-$d$ module into mutually orthogonal rank-$1$ submodules, and apply CDPR's analysis to each independently and return the shortest candidate. The Hermite factor $\exp(\tilde{O}(\sqrt{n}))$ matches the ideal case, with a module reduction factor $\alpha_d=O(1)$ independent...