:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Majumdar, Angshul
Formato:	Preprint
Publicado:	2026
Materias:	Artificial Intelligence
Acceso en línea:	https://arxiv.org/abs/2601.08280
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Sparsity Is Necessary: Polynomial-Time Stability for Agentic LLMs in Large Action Spaces
por: Majumdar, Angshul
Publicado: (2026)

Sparse Probabilistic Coalition Structure Generation: Bayesian Greedy Pursuit and $\ell_1$ Relaxations
por: Majumdar, Angshul
Publicado: (2026)

The Existential Theory of Research: Why Discovery Is Hard
por: Majumdar, Angshul
Publicado: (2026)

The Relativity of AGI: Distributional Axioms, Fragility, and Undecidability
por: Majumdar, Angshul
Publicado: (2026)

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

Near-Optimal Coalition Structures in Polynomial Time
por: Majumdar, Angshul
Publicado: (2025)

Bayesian Recovery for Probabilistic Coalition Structures
por: Majumdar, Angshul
Publicado: (2025)

Quantum-Compatible Dictionary Learning via Doubly Sparse Models
por: Majumdar, Angshul
Publicado: (2026)

Grounding LLMs in Scientific Discovery via Embodied Actions
por: Zhang, Bo, et al.
Publicado: (2026)

Tensor Spectral Threshold is $\exists\mathbb{R}$-Hard
por: Majumdar, Angshul
Publicado: (2026)

$\exists\mathbb{R}$-Completeness of Tensor Degeneracy and a Derandomization Barrier for Hyperdeterminants
por: Majumdar, Angshul
Publicado: (2026)

Diminishing Returns in Expanding Generative Models and Godel-Tarski-Lob Limits
por: Majumdar, Angshul
Publicado: (2026)

How Hard Is Continuous Clustering? Lower Bounds from the Existential Theory of the Reals
por: Majumdar, Angshul
Publicado: (2026)

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
por: Majumdar, Angshul
Publicado: (2026)

Shannon meets Gödel-Tarski-Löb: Undecidability of Shannon Feedback Capacity for Finite-State Channels
por: Majumdar, Angshul
Publicado: (2026)

Affine Rank Minimization is ER Complete
por: Majumdar, Angshul
Publicado: (2026)

A Unified Matrix Factorization Framework for Classical and Robust Clustering
por: Majumdar, Angshul
Publicado: (2025)

Dictionary-Transform Generative Adversarial Networks
por: Majumdar, Angshul
Publicado: (2025)

QV May Be Enough: Toward the Essence of Attention in LLMs
por: Edward, Zhang
Publicado: (2026)

Benchmarks are Not Enough: RAMP for Runtime Assessing of Agentic Models in Production Systems
por: Ouyang, Yipeng, et al.
Publicado: (2026)

Fitting Is Not Enough: Smoothness in Extremely Quantized LLMs
por: Xu, Yuzhuang, et al.
Publicado: (2026)

Greedy Output Approximation: Towards Efficient Structured Pruning for LLMs Without Retraining
por: Li, Jianwei, et al.
Publicado: (2024)

Agentic Skill Discovery
por: Zhao, Xufeng, et al.
Publicado: (2024)

The Good, The Bad, and The Greedy: Evaluation of LLMs Should Not Ignore Non-Determinism
por: Song, Yifan, et al.
Publicado: (2024)

Reward Is Enough: LLMs Are In-Context Reinforcement Learners
por: Song, Kefan, et al.
Publicado: (2025)

Reasoning Isn't Enough: Examining Truth-Bias and Sycophancy in LLMs
por: Barkett, Emilio, et al.
Publicado: (2025)

LLMs are Greedy Agents: Effects of RL Fine-tuning on Decision-Making Abilities
por: Schmied, Thomas, et al.
Publicado: (2025)

Sparse is Enough in Fine-tuning Pre-trained Large Language Models
por: Song, Weixi, et al.
Publicado: (2023)

ATLAS: Agentic or Latent Visual Reasoning? One Word is Enough for Both
por: Guo, Ziyu, et al.
Publicado: (2026)

Agentic AI Scientists Are Not Built For Autonomous Scientific Discovery
por: Bisht, Harshit, et al.
Publicado: (2026)

SR-Scientist: Scientific Equation Discovery With Agentic AI
por: Xia, Shijie, et al.
Publicado: (2025)

Enough Coin Flips Can Make LLMs Act Bayesian
por: Gupta, Ritwik, et al.
Publicado: (2025)

SEUF: Is Unlearning One Expert Enough for Mixture-of-Experts LLMs?
por: Zhuang, Haomin, et al.
Publicado: (2024)

When Is Enough Not Enough? Illusory Completion in Search Agents
por: Ko, Dayoon, et al.
Publicado: (2026)

Agentic Discovery of Exchange-Correlation Density Functionals
por: Duston, Titouan, et al.
Publicado: (2026)

Agentic Discovery: Closing the Loop with Cooperative Agents
por: Pauloski, J. Gregory, et al.
Publicado: (2025)

Embodied Science: Closing the Discovery Loop with Agentic Embodied AI
por: Zhuang, Xiang, et al.
Publicado: (2026)

One-Step is Enough: Sparse Autoencoders for Text-to-Image Diffusion Models
por: Surkov, Viacheslav, et al.
Publicado: (2024)

A Training-Free Length Extrapolation Approach for LLMs: Greedy Attention Logit Interpolation (GALI)
por: Li, Yan, et al.
Publicado: (2025)

Greedy-DiM: Greedy Algorithms for Unreasonably Effective Face Morphs
por: Blasingame, Zander W., et al.
Publicado: (2024)