20 results for “random linear map”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper shows that a random linear map behaves similarly to a fully random map in terms of expected loads and concentration of bin loads.
This paper studies a random compositional model for the growth of affine regions in deep piecewise-linear networks and proves the existence of a submultiplicative pressure for the number of affine pie…
Dean Doron, Tal Leonov, Jonathan Mosheiff, Henrique Navas +2 more
This paper proves that random linear codes have nearly optimal discrepancy properties in various regimes, extending classical results and enabling new applications.
This paper proves irreducibility results for a family of Markov chains used in redistricting and gerrymandering analysis.
This paper proposes a novel algorithm SME-OFU that improves the regret bound for stochastic linear contextual bandits with bounded reward noise.
This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.
Determines the limiting distribution of the rank of a random $k$-XORSAT matrix beyond the satisfiability threshold.
The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…
This paper studies the problem of detecting a hidden geometric signal in a random graph.
The paper proposes a novel set of combined cellular automaton (CA)-based pseudo-random number generators (PRNGs) that overcome the weak equidistribution issues of existing CA-based PRNGs, achieving ma…
The study investigates k-coloured Motzkin paths and their connection with prefixes ending at odd height from both analytical and combinatorial perspectives.
The paper introduces a modular version of rank and linear-complexity tests for pseudorandom number generators and provides a Rust program, modlin, to detect statistical bias in generators that are lin…
This paper proposes a new sampling strategy for Exploratory Landscape Analysis using random linear embeddings to improve the robustness of landscape descriptors when budgets are limited.
This paper settles the complexity of three sketching problems in graphs and distributions.
This paper adapts the distributed triangle-free coloring algorithm of Pettie and Su to solve LLL instances in logarithmic rounds, eliminating the LLL steps as the bottleneck.
The paper introduces Strong Stochastic Flow Maps (SSFMs), a novel framework that directly learns the strong solution map of additive-noise Stochastic Differential Equations (SDEs), enabling few-step s…