Saved in:
| Main Author: | Majumdar, Angshul |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.08280 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Sparsity Is Necessary: Polynomial-Time Stability for Agentic LLMs in Large Action Spaces
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
Sparse Probabilistic Coalition Structure Generation: Bayesian Greedy Pursuit and $\ell_1$ Relaxations
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
The Existential Theory of Research: Why Discovery Is Hard
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
The Relativity of AGI: Distributional Axioms, Fragility, and Undecidability
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
Universal NP-Hardness of Clustering under General Utilities
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
Near-Optimal Coalition Structures in Polynomial Time
by: Majumdar, Angshul
Published: (2025)
by: Majumdar, Angshul
Published: (2025)
Bayesian Recovery for Probabilistic Coalition Structures
by: Majumdar, Angshul
Published: (2025)
by: Majumdar, Angshul
Published: (2025)
Quantum-Compatible Dictionary Learning via Doubly Sparse Models
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
Grounding LLMs in Scientific Discovery via Embodied Actions
by: Zhang, Bo, et al.
Published: (2026)
by: Zhang, Bo, et al.
Published: (2026)
Tensor Spectral Threshold is $\exists\mathbb{R}$-Hard
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
$\exists\mathbb{R}$-Completeness of Tensor Degeneracy and a Derandomization Barrier for Hyperdeterminants
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
Diminishing Returns in Expanding Generative Models and Godel-Tarski-Lob Limits
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
How Hard Is Continuous Clustering? Lower Bounds from the Existential Theory of the Reals
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
Shannon meets Gödel-Tarski-Löb: Undecidability of Shannon Feedback Capacity for Finite-State Channels
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
Affine Rank Minimization is ER Complete
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
A Unified Matrix Factorization Framework for Classical and Robust Clustering
by: Majumdar, Angshul
Published: (2025)
by: Majumdar, Angshul
Published: (2025)
Dictionary-Transform Generative Adversarial Networks
by: Majumdar, Angshul
Published: (2025)
by: Majumdar, Angshul
Published: (2025)
QV May Be Enough: Toward the Essence of Attention in LLMs
by: Edward, Zhang
Published: (2026)
by: Edward, Zhang
Published: (2026)
Benchmarks are Not Enough: RAMP for Runtime Assessing of Agentic Models in Production Systems
by: Ouyang, Yipeng, et al.
Published: (2026)
by: Ouyang, Yipeng, et al.
Published: (2026)
Fitting Is Not Enough: Smoothness in Extremely Quantized LLMs
by: Xu, Yuzhuang, et al.
Published: (2026)
by: Xu, Yuzhuang, et al.
Published: (2026)
Greedy Output Approximation: Towards Efficient Structured Pruning for LLMs Without Retraining
by: Li, Jianwei, et al.
Published: (2024)
by: Li, Jianwei, et al.
Published: (2024)
Agentic Skill Discovery
by: Zhao, Xufeng, et al.
Published: (2024)
by: Zhao, Xufeng, et al.
Published: (2024)
The Good, The Bad, and The Greedy: Evaluation of LLMs Should Not Ignore Non-Determinism
by: Song, Yifan, et al.
Published: (2024)
by: Song, Yifan, et al.
Published: (2024)
Reward Is Enough: LLMs Are In-Context Reinforcement Learners
by: Song, Kefan, et al.
Published: (2025)
by: Song, Kefan, et al.
Published: (2025)
Reasoning Isn't Enough: Examining Truth-Bias and Sycophancy in LLMs
by: Barkett, Emilio, et al.
Published: (2025)
by: Barkett, Emilio, et al.
Published: (2025)
LLMs are Greedy Agents: Effects of RL Fine-tuning on Decision-Making Abilities
by: Schmied, Thomas, et al.
Published: (2025)
by: Schmied, Thomas, et al.
Published: (2025)
Sparse is Enough in Fine-tuning Pre-trained Large Language Models
by: Song, Weixi, et al.
Published: (2023)
by: Song, Weixi, et al.
Published: (2023)
ATLAS: Agentic or Latent Visual Reasoning? One Word is Enough for Both
by: Guo, Ziyu, et al.
Published: (2026)
by: Guo, Ziyu, et al.
Published: (2026)
Agentic AI Scientists Are Not Built For Autonomous Scientific Discovery
by: Bisht, Harshit, et al.
Published: (2026)
by: Bisht, Harshit, et al.
Published: (2026)
SR-Scientist: Scientific Equation Discovery With Agentic AI
by: Xia, Shijie, et al.
Published: (2025)
by: Xia, Shijie, et al.
Published: (2025)
Enough Coin Flips Can Make LLMs Act Bayesian
by: Gupta, Ritwik, et al.
Published: (2025)
by: Gupta, Ritwik, et al.
Published: (2025)
SEUF: Is Unlearning One Expert Enough for Mixture-of-Experts LLMs?
by: Zhuang, Haomin, et al.
Published: (2024)
by: Zhuang, Haomin, et al.
Published: (2024)
When Is Enough Not Enough? Illusory Completion in Search Agents
by: Ko, Dayoon, et al.
Published: (2026)
by: Ko, Dayoon, et al.
Published: (2026)
Agentic Discovery of Exchange-Correlation Density Functionals
by: Duston, Titouan, et al.
Published: (2026)
by: Duston, Titouan, et al.
Published: (2026)
Agentic Discovery: Closing the Loop with Cooperative Agents
by: Pauloski, J. Gregory, et al.
Published: (2025)
by: Pauloski, J. Gregory, et al.
Published: (2025)
Embodied Science: Closing the Discovery Loop with Agentic Embodied AI
by: Zhuang, Xiang, et al.
Published: (2026)
by: Zhuang, Xiang, et al.
Published: (2026)
One-Step is Enough: Sparse Autoencoders for Text-to-Image Diffusion Models
by: Surkov, Viacheslav, et al.
Published: (2024)
by: Surkov, Viacheslav, et al.
Published: (2024)
A Training-Free Length Extrapolation Approach for LLMs: Greedy Attention Logit Interpolation (GALI)
by: Li, Yan, et al.
Published: (2025)
by: Li, Yan, et al.
Published: (2025)
Greedy-DiM: Greedy Algorithms for Unreasonably Effective Face Morphs
by: Blasingame, Zander W., et al.
Published: (2024)
by: Blasingame, Zander W., et al.
Published: (2024)
Similar Items
-
Sparsity Is Necessary: Polynomial-Time Stability for Agentic LLMs in Large Action Spaces
by: Majumdar, Angshul
Published: (2026) -
Sparse Probabilistic Coalition Structure Generation: Bayesian Greedy Pursuit and $\ell_1$ Relaxations
by: Majumdar, Angshul
Published: (2026) -
The Existential Theory of Research: Why Discovery Is Hard
by: Majumdar, Angshul
Published: (2026) -
The Relativity of AGI: Distributional Axioms, Fragility, and Undecidability
by: Majumdar, Angshul
Published: (2026) -
Universal NP-Hardness of Clustering under General Utilities
by: Majumdar, Angshul
Published: (2026)