Copertina

Reinforced Generation of Combinatorial Structures: Hardness of Approximation

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Nagda, Ansh, Raghavan, Prabhakar, Thakurta, Abhradeep
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Artificial Intelligence Computational Complexity Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Reinforced Generation of Combinatorial Structures: Ramsey Numbers
di: Nagda, Ansh, et al.
Pubblicazione: (2026)

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

A Measure-Theoretic Analysis of Reasoning: Structural Generalization and Approximation Limits
di: Zhang, Yuyang, et al.
Pubblicazione: (2026)

Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
di: Dvijotham, Krishnamurthy, et al.
Pubblicazione: (2024)

When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?
di: Li, Chenyang, et al.
Pubblicazione: (2025)

Modern Hopfield Networks Require Chain-of-Thought to Solve $\mathsf{NC}^1$-Hard Problems
di: Cao, Yang, et al.
Pubblicazione: (2024)

Low-degree learning and the metric entropy of polynomials
di: Eskenazis, Alexandros, et al.
Pubblicazione: (2022)

On optimal distinguishers for Planted Clique
di: Nagda, Ansh, et al.
Pubblicazione: (2025)

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

Stronger Approximation Guarantees for Non-Monotone γ-Weakly DR-Submodular Maximization
di: Jadav, Hareshkumar, et al.
Pubblicazione: (2026)

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

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

Have Large Language Models Learned to Reason? A Characterization via 3-SAT Phase Transition
di: Hazra, Rishi, et al.
Pubblicazione: (2025)

A Theory of Learning with Autoregressive Chain of Thought
di: Joshi, Nirmit, et al.
Pubblicazione: (2025)

Provable Failure of Language Models in Learning Majority Boolean Logic via Gradient Descent
di: Chen, Bo, et al.
Pubblicazione: (2025)

Provably Overwhelming Transformer Models with Designed Inputs
di: Stambler, Lev, et al.
Pubblicazione: (2025)

Limitations on Accurate, Trusted, Human-level Reasoning
di: Panigrahy, Rina, et al.
Pubblicazione: (2025)

On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
di: Li, Xiaoyu, et al.
Pubblicazione: (2025)

Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models
di: Hu, Jerry Yao-Chieh, et al.
Pubblicazione: (2024)

Lossless Model Compression via Joint Low-Rank Factorization Optimization
di: Zhang, Boyang, et al.
Pubblicazione: (2024)

Learning to Think from Multiple Thinkers
di: Joshi, Nirmit, et al.
Pubblicazione: (2026)

A Provable Expressiveness Hierarchy in Hybrid Linear-Full Attention
di: Ye, Xiaowei, et al.
Pubblicazione: (2026)

On the Expressive Power and Limitations of Multi-Layer SSMs
di: Zubić, Nikola, et al.
Pubblicazione: (2026)

Looped ReLU MLPs May Be All You Need as Practical Programmable Computers
di: Liang, Yingyu, et al.
Pubblicazione: (2024)

Mathematical Formalism for Memory Compression in Selective State Space Models
di: Bhat, Siddhanth
Pubblicazione: (2024)

A Unified Approach for Maximizing Continuous DR-submodular Functions
di: Pedramfar, Mohammad, et al.
Pubblicazione: (2023)

Mathematical Algorithm Design for Deep Learning under Societal and Judicial Constraints: The Algorithmic Transparency Requirement
di: Boche, Holger, et al.
Pubblicazione: (2024)

How Much Cache Does Reasoning Need? Depth-Cache Tradeoffs in KV-Compressed Transformers
di: Wang, Xiao
Pubblicazione: (2026)

A Quantitative Definition of Intelligence
di: Choi, Kang-Sin
Pubblicazione: (2026)

Reasonable Bounds for Combinatorial Lines of Length Three
di: Bhangale, Amey, et al.
Pubblicazione: (2024)

Hardness of Hypergraph Edge Modification Problems
di: Gishboliner, Lior, et al.
Pubblicazione: (2025)

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

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

Universal NP-Hardness of Clustering under General Utilities
di: Majumdar, Angshul
Pubblicazione: (2026)

Rethinking Model-based, Policy-based, and Value-based Reinforcement Learning via the Lens of Representation Complexity
di: Feng, Guhao, et al.
Pubblicazione: (2023)

Learning Tree Pattern Transformations
di: Neider, Daniel, et al.
Pubblicazione: (2024)

Nearest Neighbor CCP-Based Molecular Sequence Analysis
di: Ali, Sarwan, et al.
Pubblicazione: (2024)

Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs
di: Li, Xin, et al.
Pubblicazione: (2023)

The Alignment Trap: Complexity Barriers
di: Yao, Jasper
Pubblicazione: (2025)

Neural Algorithmic Reasoning for Hypergraphs with Looped Transformers
di: Huang, Zekai, et al.
Pubblicazione: (2025)