Imagen de Portada

Low-degree phase transitions for detecting a planted clique in sublinear time

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Mardia, Jay, Verchand, Kabir Aladin, Wein, Alexander S.
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Computational Complexity Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

High-dimensional estimation with missing data: Statistical and computational limits
por: Verchand, Kabir Aladin, et al.
Publicado: (2026)

Tensor cumulants for statistical inference on invariant distributions
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

A computational phase transition for learning-to-sample from Ising models
por: Risteski, Andrej, et al.
Publicado: (2026)

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

Sharp Phase Transitions in Estimation with Low-Degree Polynomials
por: Sohn, Youngtak, et al.
Publicado: (2025)

Improved Hardness-of-Approximation for Token Swapping
por: Hiken, Sam, et al.
Publicado: (2024)

Rate-optimal community detection near the KS threshold via node-robust algorithms
por: Ding, Jingqiu, et al.
Publicado: (2025)

Low-Degree Method Fails to Predict Robust Subspace Recovery
por: Jia, He, et al.
Publicado: (2026)

Constructing self-referential instances for the clique problem
por: Li, Jiaqi, et al.
Publicado: (2026)

Low-degree estimation thresholds in planted hypergraphs and tensor PCA
por: Fu, Daniel, et al.
Publicado: (2026)

Superconstant Inapproximability of Decision Tree Learning
por: Koch, Caleb, et al.
Publicado: (2024)

Fast decision tree learning solves hard coding-theoretic problems
por: Koch, Caleb, et al.
Publicado: (2024)

Adaptive and oblivious statistical adversaries are equivalent
por: Blanc, Guy, et al.
Publicado: (2024)

Private graphon estimation via sum-of-squares
por: Chen, Hongjie, et al.
Publicado: (2024)

Omnipredictors for Regression and the Approximate Rank of Convex Functions
por: Gopalan, Parikshit, et al.
Publicado: (2024)

On the Power of Interactive Proofs for Learning
por: Gur, Tom, et al.
Publicado: (2024)

Hardness of Learning Boolean Functions from Label Proportions
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
por: Blanc, Guy, et al.
Publicado: (2024)

Exact and Approximate Algorithms for Polytree Learning
por: Harviainen, Juha, et al.
Publicado: (2026)

Differentially Private Verification of Distribution Properties
por: Du, Elbert, et al.
Publicado: (2026)

Efficient and Private Property Testing via Indistinguishability
por: Dwork, Cynthia, et al.
Publicado: (2025)

A Distributional-Lifting Theorem for PAC Learning
por: Blanc, Guy, et al.
Publicado: (2025)

Feature Selection and Junta Testing are Statistically Equivalent
por: Beretta, Lorenzo, et al.
Publicado: (2025)

Cascaded Learned Bloom Filter for Optimal Model-Filter Size Balance and Fast Rejection
por: Sato, Atsuki, et al.
Publicado: (2025)

Samplability makes learning easier
por: Blanc, Guy, et al.
Publicado: (2025)

Efficient Turing Machine Simulation with Transformers
por: Li, Qian, et al.
Publicado: (2025)

The Sample Complexity of Replicable Realizable PAC Learning
por: Larsen, Kasper Green, et al.
Publicado: (2026)

Is nasty noise actually harder than malicious noise?
por: Blanc, Guy, et al.
Publicado: (2025)

Active Learning for Decision Trees with Provable Guarantees
por: Moakhar, Arshia Soltani, et al.
Publicado: (2026)

On the Hardness of Approximation of the Fair k-Center Problem
por: Thejaswi, Suhas
Publicado: (2026)

Computational-Statistical Tradeoffs from NP-hardness
por: Blanc, Guy, et al.
Publicado: (2025)

Learning-Augmented Algorithms for Boolean Satisfiability
por: Attias, Idan, et al.
Publicado: (2025)

The Computational Complexity of Almost Stable Clustering with Penalties
por: Khodamoradi, Kamyar, et al.
Publicado: (2025)

AdaBoost is not an Optimal Weak to Strong Learner
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2023)

Hardness of Maximum Likelihood Learning of DPPs
por: Grigorescu, Elena, et al.
Publicado: (2022)

Supersimulators
por: Dwork, Cynthia, et al.
Publicado: (2025)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Testing noisy low-degree polynomials for sparsity
por: Bao, Yiqiao, et al.
Publicado: (2025)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
por: Apers, Simon, et al.
Publicado: (2021)

Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood
por: Chen, Sitan, et al.
Publicado: (2025)