Cover Image

Resilience of Rademacher chaos of low degree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aigner-Horev, Elad, Rosenberg, Daniel, Weiss, Roi
Format:	Preprint
Published:	2024
Subjects:	Probability Information Theory Machine Learning Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

Smoothed analysis in compressed sensing
by: Aigner-Horev, Elad, et al.
Published: (2025)

Detecting Arbitrary Planted Subgraphs in Random Graphs
by: Elimelech, Dor, et al.
Published: (2025)

Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models
by: Kunisky, Dmitriy
Published: (2024)

Ramsey properties of randomly perturbed hypergraphs
by: Aigner-Horev, Elad, et al.
Published: (2023)

Equal Requests are Asymptotically Hardest for Data Recovery
by: Lember, Jüri, et al.
Published: (2024)

Information Inequalities for Joint Distributions, with Interpretations and Applications
by: Madiman, Mokshay, et al.
Published: (2008)

Individual testing is optimal for nonadaptive group testing in the linear regime
by: Aldridge, Matthew
Published: (2018)

The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice
by: Bruno, Roberto, et al.
Published: (2026)

Bernoulli sums and Rényi entropy inequalities
by: Madiman, Mokshay, et al.
Published: (2021)

Geometry of Rényi Entropy on the Majorization Lattice
by: Yadav, Anuj Kumar, et al.
Published: (2026)

Community detection with the Bethe-Hessian
by: Stephan, Ludovic, et al.
Published: (2024)

Achieving the Kesten-Stigum bound in the non-uniform hypergraph stochastic block model
by: Fernandez V, Manuel, et al.
Published: (2026)

Quantifying Multivariate Graph Dependencies: Theory and Estimation for Multiplex Graphs
by: Skeja, Anda, et al.
Published: (2024)

Partial and Exact Recovery of a Random Hypergraph from its Graph Projection
by: Bresler, Guy, et al.
Published: (2025)

Complete Causal Identification from Ancestral Graphs under Selection Bias
by: Chen, Leihao, et al.
Published: (2026)

The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)

Sample Complexity of Low-rank Tensor Recovery from Uniformly Random Entries
by: Hamaguchi, Hiroki, et al.
Published: (2024)

Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity
by: Yu, Lei, et al.
Published: (2021)

Parsings of Stationary Processes, Stopping Times and the Fundamental Pointwise Convergence Theorems of Ergodic Theory
by: Tal, Matan
Published: (2025)

Rényi--Sobolev Inequalities and Connections to Spectral Graph Theory
by: Yu, Lei, et al.
Published: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

A Unified MDL-based Binning and Tensor Factorization Framework for PDF Estimation
by: Musab, Mustafa, et al.
Published: (2025)

Matrices with Gaussian noise: optimal estimates for singular subspace perturbation
by: O'Rourke, Sean, et al.
Published: (2018)

A large deviation view of \emph{stationarized} fully lifted blirp interpolation
by: Stojnic, Mihailo
Published: (2025)

Two-Sided Bounds for Entropic Optimal Transport via a Rate-Distortion Integral
by: Liu, Jingbo
Published: (2026)

A discrete Benamou-Brenier formulation of Optimal Transport on graphs
by: Morris, Kieran, et al.
Published: (2026)

ItDPDM: Information-Theoretic Discrete Poisson Diffusion Model
by: Bhattacharya, Sagnik, et al.
Published: (2025)

Near-Optimal Clustering in Mixture of Markov Chains
by: Lee, Junghyun, et al.
Published: (2025)

Fully lifted \emph{blirp} interpolation -- a large deviation view
by: Stojnic, Mihailo
Published: (2025)

On Statistical Estimation of Edge-Reinforced Random Walks
by: Qinghua, et al.
Published: (2025)

A Link between Coding Theory and Cross-Validation with Applications
by: Pahikkala, Tapio, et al.
Published: (2021)

Randomstrasse101: Open Problems of 2024
by: Bandeira, Afonso S., et al.
Published: (2025)

Randomstrasse101: Open Problems of 2025
by: Bandeira, Afonso S., et al.
Published: (2026)

The Optimal Approximation Factor in Density Estimation
by: Bousquet, Olivier, et al.
Published: (2019)

Matrix Denoising with Doubly Heteroscedastic Noise: Fundamental Limits and Optimal Spectral Methods
by: Zhang, Yihan, et al.
Published: (2024)

Generating Rectifiable Measures through Neural Networks
by: Riegler, Erwin, et al.
Published: (2024)

Unifying AMP Algorithms for Rotationally-Invariant Models
by: Liu, Songbin, et al.
Published: (2024)