Copertina

Learning-Augmented Algorithms for Boolean Satisfiability

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Attias, Idan, Gao, Xing, Reyzin, Lev
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Computational Complexity Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

On the Hardness of Learning Regular Expressions
di: Attias, Idan, et al.
Pubblicazione: (2025)

Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
di: Attias, Idan, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

Non-Redundancy of Low-Arity Symmetric Boolean CSPs
di: Sharma, Amatya, et al.
Pubblicazione: (2026)

New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
di: Brakensiek, Joshua, et al.
Pubblicazione: (2026)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
di: Sato, Atsuki, et al.
Pubblicazione: (2024)

Search-space Reduction for Boolean MinCSPs via Essential Constraints
di: Jansen, Bart M. P., et al.
Pubblicazione: (2026)

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

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

Samplability makes learning easier
di: Blanc, Guy, et al.
Pubblicazione: (2025)

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

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

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

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

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

Supersimulators
di: Dwork, Cynthia, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

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

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

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

Non-adaptive Learning of Random Hypergraphs with Queries
di: Austhof, Bethany, et al.
Pubblicazione: (2025)

Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
di: Kim, Eun Jung, et al.
Pubblicazione: (2022)

Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems
di: Hu, Bingbing, et al.
Pubblicazione: (2024)

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

Diversity-aware clustering: Computational Complexity and Approximation Algorithms
di: Thejaswi, Suhas, et al.
Pubblicazione: (2024)

An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Linear Systems
di: Grønlund, Allan, et al.
Pubblicazione: (2024)