arXiv Machine Learning
What Must Survive? Exact Task-Information--State Frontiers for Resource-Sufficient Learning
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
1d ago
What Must Survive? Exact Task-Information--State Frontiers Under Partial Task Revelation
arXiv:2609. 21523v2 Announce Type: replace Abstract: A state may need to be compressed before its exact downstream task is known.
arXiv Machine Learning
Jul 28
The Entropic Bound for Transformers: Why Static Rank Fails and Attention-Native Rank Recovers
arXiv:2607. 23050v1 Announce Type: new Abstract: Neural scaling laws describe how loss decreases as models, data, and compute grow, but they do not answer a prior question: for a fixed task, what is the minimum model capacity required to solve it?
arXiv Machine Learning
Aug 11
Information Routing across Batch Boundaries: Memory--Batch Tradeoffs in Lipschitz Bandits
arXiv:2608. 07922v1 Announce Type: new Abstract: Adaptive learning needs both a state that preserves what observations imply and opportunities to act on that state.
arXiv Machine Learning
Aug 27
How Much Rank Does LoRA Need? Rank-Error Bounds for Transformer Attention
arXiv:2608. 26052v1 Announce Type: new Abstract: Choosing the rank of a low-rank adaptation (LoRA) update is usually an empirical task.
arXiv Machine Learning
Sep 4
EF1-Constrained Nash Social Welfare with Identical Additive Valuations: Complexity, Guarantees, and Experiments
arXiv:2609. 03846v1 Announce Type: cross Abstract: We study the allocation of indivisible goods among agents with identical additive valuations, focusing on envy-freeness up to one good (EF1) and Nash social welfare (NSW).
arXiv Machine Learning
Jun 30
SMaRT: Online Reusable Resource Assignment and an Application to Mediation in the Kenyan Judiciary
arXiv:2602. 18431v2 Announce Type: replace-cross Abstract: Motivated by the problem of assigning mediators to cases in the Kenyan judicial system, we study an online resource allocation problem where incoming tasks (cases) must be immediately assigned to available, capacity-constrained resources (mediators).