Imagen de Portada

On Language Generation in the Limit with Bounded Memory

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kleinberg, Jon, Mehrotra, Anay, Saberi, Amin, Velegkas, Grigoris
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Artificial Intelligence Computation and Language Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Limits of Language Generation: Trade-Offs Between Hallucination and Mode Collapse
por: Kalavasis, Alkis, et al.
Publicado: (2024)

Differentially Private Language Generation and Identification in the Limit
por: Mehrotra, Anay, et al.
Publicado: (2026)

On Characterizations for Language Generation: Interplay of Hallucinations, Breadth, and Stability
por: Kalavasis, Alkis, et al.
Publicado: (2024)

Language Generation with Infinite Contamination
por: Mehrotra, Anay, et al.
Publicado: (2025)

Language Generation in the Limit
por: Kleinberg, Jon, et al.
Publicado: (2024)

What is Learnable in Valiant's Theory of the Learnable?
por: Hanneke, Steve, et al.
Publicado: (2026)

Language Generation and Identification From Partial Enumeration: Tight Density Bounds and Topological Characterizations
por: Kleinberg, Jon, et al.
Publicado: (2025)

Exploring Facets of Language Generation in the Limit
por: Charikar, Moses, et al.
Publicado: (2024)

Mistake-Bounded Language Generation
por: Kleinberg, Jon, et al.
Publicado: (2026)

Contrastive Identification and Generation in the Limit
por: Li, Xiaoyu, et al.
Publicado: (2026)

Replicable Clustering
por: Esfandiari, Hossein, et al.
Publicado: (2023)

A Characterization of List Language Identification in the Limit
por: Charikar, Moses, et al.
Publicado: (2025)

Replicable Learning of Large-Margin Halfspaces
por: Kalavasis, Alkis, et al.
Publicado: (2024)

Improved Guarantees for Heterogeneous Treatment-Effect Estimation via Matrix Completion
por: Mehrotra, Anay, et al.
Publicado: (2026)

Pareto-optimal Non-uniform Language Generation
por: Charikar, Moses, et al.
Publicado: (2025)

SubGen: Token Generation in Sublinear Time and Memory
por: Zandieh, Amir, et al.
Publicado: (2024)

On the Learning Curves of Revenue Maximization
por: Hanneke, Steve, et al.
Publicado: (2026)

The CLRS-Text Algorithmic Reasoning Language Benchmark
por: Markeeva, Larisa, et al.
Publicado: (2024)

Procurement Auctions via Approximately Optimal Submodular Optimization
por: Deng, Yuan, et al.
Publicado: (2024)

Characterizing the Effect of Noise in Language Generation in the Limit
por: Li, Aaron, et al.
Publicado: (2026)

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
por: Lee, Jane H., et al.
Publicado: (2024)

The Library Theorem: How External Organization Governs Agentic Reasoning Capacity
por: Mainen, Zachary F.
Publicado: (2026)

GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling
por: Katsch, Tobias
Publicado: (2023)

Learning Linear Attention in Polynomial Time
por: Yau, Morris, et al.
Publicado: (2024)

A Tighter Complexity Analysis of SparseGPT
por: Li, Xiaoyu, et al.
Publicado: (2024)

Can SGD Select Good Fishermen? Local Convergence under Self-Selection Biases and Beyond
por: Kalavasis, Alkis, et al.
Publicado: (2025)

Memory-Efficient Sequential Pattern Mining with Hybrid Tries
por: Hosseininasab, Amin, et al.
Publicado: (2022)

A Note on Non-Negative $L_1$-Approximating Polynomials
por: Lee, Jane H., et al.
Publicado: (2026)

Smoothed Analysis of Learning from Positive Samples
por: Lee, Jane H., et al.
Publicado: (2025)

HashEvict: A Pre-Attention KV Cache Eviction Strategy using Locality-Sensitive Hashing
por: Liu, Minghui, et al.
Publicado: (2024)

Linear Regression with Unknown Truncation Beyond Gaussian Features
por: Kouridakis, Alexandros, et al.
Publicado: (2026)

DDPM Score Matching and Distribution Learning
por: Chewi, Sinho, et al.
Publicado: (2025)

Learning Algorithms in the Limit
por: Papazov, Hristo, et al.
Publicado: (2025)

Tokenisation over Bounded Alphabets is Hard
por: Kastreva, Violeta, et al.
Publicado: (2025)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
por: Harris, Blake, et al.
Publicado: (2024)

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
por: Brita, Catalin E., et al.
Publicado: (2025)

MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
por: Hayderi, Alexandre, et al.
Publicado: (2024)

Mean Estimation from Coarse Data: Characterizations and Efficient Algorithms
por: Kalavasis, Alkis, et al.
Publicado: (2026)

Hallucination is a Consequence of Space-Optimality: A Rate-Distortion Theorem for Membership Testing
por: Guo, Anxin, et al.
Publicado: (2026)

(Im)possibility of Automated Hallucination Detection in Large Language Models
por: Karbasi, Amin, et al.
Publicado: (2025)