Copertina

Low-degree learning and the metric entropy of polynomials

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Eskenazis, Alexandros, Ivanisvili, Paata, Streck, Lauritz
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Machine Learning Computational Complexity Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Counterexample to majority optimality in NICD with erasures
di: Ivanisvili, Paata, et al.
Pubblicazione: (2025)

On the degree of polynomials computing square roots mod p
di: Kedlaya, Kiran, et al.
Pubblicazione: (2023)

Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions
di: Li, Rupert, et al.
Pubblicazione: (2025)

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
di: Dhawan, Abhishek, et al.
Pubblicazione: (2024)

On the Expressibility of the Reconstructional Color Refinement
di: Arvind, V., et al.
Pubblicazione: (2024)

Reinforced Generation of Combinatorial Structures: Hardness of Approximation
di: Nagda, Ansh, et al.
Pubblicazione: (2025)

A parameterized algorithm for $K_r$-factors in graphs of high minimum degree
di: Gan, Luyining, et al.
Pubblicazione: (2023)

On hardness of computing analytic Brouwer degree
di: Chakraborty, Somnath
Pubblicazione: (2023)

Bounded degree QBF and positional games
di: Oijid, Nacim
Pubblicazione: (2024)

Low-Degree Polynomials Are Good Extractors
di: Alrabiah, Omar, et al.
Pubblicazione: (2024)

The Parameterized Complexity of Computing the VC-Dimension
di: Foucaud, Florent, et al.
Pubblicazione: (2025)

Arithmetic Circuits and Neural Networks for Regular Matroids
di: Hertrich, Christoph, et al.
Pubblicazione: (2025)

Neural Networks and (Virtual) Extended Formulations
di: Hertrich, Christoph, et al.
Pubblicazione: (2024)

The Computational Complexity of Counting Linear Regions in ReLU Neural Networks
di: Stargalla, Moritz, et al.
Pubblicazione: (2025)

Low degree conjecture implies sharp computational thresholds in stochastic block model
di: Ding, Jingqiu, et al.
Pubblicazione: (2025)

Constant congestion linkages in polynomially strong digraphs in polynomial time
di: Lopes, Raul, et al.
Pubblicazione: (2024)

Multiversion of the Hausdorff--Young inequality
di: Ivanisvili, Paata, et al.
Pubblicazione: (2025)

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy
di: Ikenmeyer, Christian, et al.
Pubblicazione: (2022)

Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
di: Bhore, Sujoy, et al.
Pubblicazione: (2026)

Non-Clashing Teaching Maps for Balls in Graphs
di: Chalopin, Jérémie, et al.
Pubblicazione: (2023)

Low-degree phase transitions for detecting a planted clique in sublinear time
di: Mardia, Jay, et al.
Pubblicazione: (2024)

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
di: Hollender, Alexandros, et al.
Pubblicazione: (2023)

HNN extensions of free groups with equal associated subgroups of finite index: polynomial time word problem
di: Shen, Hanwen, et al.
Pubblicazione: (2025)

The monotonicity of the Franz-Parisi potential is equivalent with Low-degree MMSE lower bounds
di: Tsirkas, Konstantinos, et al.
Pubblicazione: (2026)

The metric Menger problem
di: Baligács, Júlia, et al.
Pubblicazione: (2024)

Sharp Lower Bounds for Dyadic Square Functions of indicator functions of sets
di: Alpay, Natanael, et al.
Pubblicazione: (2025)

Punctured Low-Bias Codes Behave Like Random Linear Codes
di: Guruswami, Venkatesan, et al.
Pubblicazione: (2021)

Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
di: Dikstein, Yotam, et al.
Pubblicazione: (2024)

Low-Rank Matrix Approximation for Neural Network Compression
di: Cherukuri, Kalyan, et al.
Pubblicazione: (2025)

Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension
di: Chandrasekaran, Gautam, et al.
Pubblicazione: (2024)

New Hardness Results for Low-Rank Matrix Completion
di: Chawin, Dror, et al.
Pubblicazione: (2025)

Sandwiching Polynomials for Geometric Concepts with Low Intrinsic Dimension
di: Klivans, Adam R., et al.
Pubblicazione: (2026)

Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials
di: Luo, Yuetian, et al.
Pubblicazione: (2023)

On the Keevash-Knox-Mycroft Conjecture
di: Gan, Luyining, et al.
Pubblicazione: (2022)

The Complexity Classes of Hamming Distance Recoverable Robust Problems
di: Grüne, Christoph
Pubblicazione: (2022)

The geodesic cover problem for butterfly networks
di: Manuel, Paul, et al.
Pubblicazione: (2022)

The Cheeger Inequality and Coboundary Expansion: Beyond Constant Coefficients
di: First, Uriya A., et al.
Pubblicazione: (2022)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
di: Eagling-Vose, Tala, et al.
Pubblicazione: (2025)

Refuting Perfect Matchings in Spectral Expanders is Hard
di: Biswas, Ari, et al.
Pubblicazione: (2025)

A Note on the Complexity of Directed Clique
di: Gutowski, Grzegorz, et al.
Pubblicazione: (2026)