What do these badges mean?
- 🚀ShippingCode exists. Multiple GitHub repos already reference this paper — people are building on it.
- 📈ClimbingCitation velocity is rising. Researchers are starting to pick it up.
- 💤QuietPublished but no notable signal yet. Most papers live here — could become anything later.
- 🎭HypeHeavy social buzz but no shipping signal. The counter-signal — defer until Twitter/X data is wired up.
- 💤Quiet2610.13948·Oct 9, 2026·~9 mincs.AIcs.IR
Can Language Models Play the Wikipedia Game?
Alexander Hickey, Joanna Knight, James Bishop
⭐ 0 stars / 0 repos📚 0 citesELI5Researchers tested whether AI language models can play the Wikipedia Game—where you navigate from one article to another using only links to reach a target. They built giant local networks of Wikipedia pages and academic papers, then compared how well different AI models, humans, and simple algorithms navigate these graphs.
Problem solvedIt's hard to evaluate whether language models can actually find information in massive document collections without hitting API limits or relying on search engines. This test provides a free, reproducible way to measure how well different models navigate and reason through interconnected information at scale.
- 💤Quiet2610.13935·Oct 9, 2026·~10 mincs.CVcs.AIcs.LG
Hide and Seek: HIDE Concepts to SEEK explanations for black box models
Bhanu Tokas, Rahul Nair, Rockwell Jackson, Hannah Kerner
⭐ 0 stars / 0 repos📚 0 citesELI5A technique that explains what a black-box image model is looking at by finding images containing specific concepts, masking those concepts, and seeing how the model's output changes—no need to peek inside the model or hand-label thousands of images.
Problem solvedUnderstanding why vision models make decisions is hard when you can't access their internals or afford to label concept datasets. This method works on any vision model (image captioning, segmentation, etc.) using just a concept name and unlabeled images.
- 💤Quiet2610.13931·Oct 9, 2026·~10 minmath.ATcs.LG
Constructive Bounds for the Topological Expressivity of Neural Networks
Kosio Beshkov
⭐ 0 stars / 0 repos📚 0 citesELI5This paper figures out how big a neural network needs to be to create outputs with specific topological shapes — like whether the data forms holes, loops, or higher-dimensional structures. Think of it like asking: 'How many neurons do I need to make my model output data shaped like a donut versus a sphere?'
Problem solvedPreviously, measuring what shapes a neural network can create was only useful for classification tasks with decision boundaries. This work extends that to regression and other problems where you care about the actual shape of the network's output, giving concrete architectural requirements instead of just theoretical limits.
- 💤Quiet2610.13928·Oct 9, 2026·~8 mincs.LGcs.CR
AI Models Can Provably Hide Arbitrary Capabilities
Andis Draguns, Sumeet Ramesh Motwani, Raymond Douglas, Christian Schroeder de Witt
⭐ 0 stars / 0 repos📚 0 citesELI5Researchers show that AI models can hide capabilities inside their weights using encryption—like a spy hiding secret instructions in plain sight. Even if someone examines the model completely, they can't find or trigger these hidden abilities without the secret key.
Problem solvedSafety evaluators test AI models to catch dangerous capabilities before deployment, but this work proves that adversarial actors could embed hidden, undetectable skills that standard audits can't find—undermining the reliability of pre-deployment safety checks.
- 💤Quiet2610.13924·Oct 9, 2026·~12 mincs.LGcs.IT
KL Before and After Mixing: A Round-Complexity Separation in Parallel Sampling
Tianyi Wu
⭐ 0 stars / 0 repos📚 0 citesELI5When you're sampling from a probability distribution in parallel by randomly choosing which coordinates to generate together, there are two ways to measure how close your samples are to the target: average the error per schedule, or measure the error of the averaged distribution. This paper shows these two methods can require vastly different numbers of rounds—one needs O((log n)²) rounds while the other needs only O(log log n) rounds.
Problem solvedParallel sampling algorithms need to know how many communication rounds are required to generate accurate samples. The paper reveals that how you measure approximation quality dramatically affects the actual complexity required—choosing the right metric can reduce rounds exponentially, which matters for distributed and parallel inference systems.
- 💤Quiet2610.13923·Oct 9, 2026·~12 mincs.NIcs.LGeess.SY
Goal-Oriented Bundle Management and Flow Control for Deep-Space Communications via Reinforcement Learning
Sajjad Baghaeea, Aimin Lib, Shanmugarajan Balasubramanian, Elif Uysal
⭐ 0 stars / 0 repos📚 0 citesELI5A spacecraft relay station uses AI to decide which messages to send to Earth when it only has brief contact windows—like a mail sorter that must pick the most important packages based on how stale they are and which planet they came from.
Problem solvedDeep-space networks can't send everything due to contact time limits and storage constraints. Simple schedulers like FIFO ignore which data matters most to missions, wasting precious communication windows and delivering outdated information. This system prioritizes based on mission goals.
- 💤Quiet2610.13918·Oct 9, 2026·~11 mincs.NEcs.ETcs.LG
DyssomniaNN: Multi-Scale Spiking Neural Modeling of Human Sleep Disorders and Perceived Restedness
Daniel Szelogowski
⭐ 0 stars / 0 repos📚 0 citesELI5A computational model simulating how the brain controls sleep using spiking neurons. It explains why some people feel unrested despite sleeping normally (like misperceiving how much they actually slept) and models five different sleep disorders to match real EEG brain recordings.
Problem solvedDoctors see patients who sleep enough hours but still feel exhausted, or vice versa. This model reveals the neural mechanism behind that mismatch—objective sleep duration doesn't predict how restored someone actually feels—enabling better understanding of why treatments fail.
- 💤Quiet2610.13917·Oct 9, 2026·~12 mincs.LGq-bio.BM
Designing Protein Structures from Natural Language
Joseph Lee, Yanjing Li, Bo Qiang, Gregory Lau, +6
⭐ 0 stars / 0 repos📚 0 citesELI5A system that designs new proteins by describing what you want in plain English, like how you'd describe an image to an AI artist. It learns from 1.8M proteins with text descriptions, then generates protein structures that match your natural language instructions.
Problem solvedProtein engineers had to use clunky, technical inputs to design proteins with specific properties. Now they can just describe what they want in English—faster iteration, broader design goals, and no need to retrain for each new property.
- 💤Quiet2610.13912·Oct 9, 2026·~10 mincs.CL
RSI-Anything: Unlocking Recursive Self-Improvement with World Models
Taoyong Cui, Pinxian Zeng, Wanghan Xu, Hao Xiao, +7
⭐ 0 stars / 0 repos📚 0 citesELI5A system that learns to get better at tasks by building an internal model of how the world works, then uses that model to make smarter decisions and gradually improve itself without needing constant outside feedback.
Problem solvedAI systems hit a wall when they need human feedback to improve or when their predictions drift as they evolve. This framework lets systems self-improve continuously by using world models to guide learning, dramatically speeding up progress in code repair, automation, and scientific discovery.
- 💤Quiet2610.13910·Oct 9, 2026·~9 mincs.CL
When VLMs Destroy What They Know: Spatial Representations Fall Below Lexical Priors
Shubh Garg, Chen Shani
⭐ 0 stars / 0 repos📚 0 citesELI5VLMs claim to understand spatial relationships in images (like 'cat on table'), but when you look at their internal memory of these relationships, they're actually much worse at remembering them than they are at remembering simple word meanings. It's like they can describe a scene perfectly but their brain doesn't actually store that spatial structure properly.
Problem solvedCurrent VLM benchmarks only test if models give correct outputs—they don't check if the model actually understands spatial relationships internally. This means a VLM could pass tests while silently losing relational information between layers, making it unreliable for downstream tasks that depend on spatial reasoning.
- 💤Quiet2610.13909·Oct 9, 2026·~13 mincs.LGcs.AI
Revisiting Tabular Deep Regression: Objectives and the Limits of Global Early Stopping
Danil Rudenko, Georgii Bulgakov, Nikolay Kartashev, Ivan Rubachev, +2
⭐ 0 stars / 0 repos📚 0 citesELI5When training neural networks on spreadsheet-like data to predict numbers, researchers tested different training goals (like 'minimize average error' vs others) and found that most don't beat a well-tuned baseline—except quantile loss. They also discovered that different parts of your data might need different training lengths, so stopping at one point hurts performance.
Problem solvedTeams building ML systems on tabular data don't know which loss function to use or when to stop training, leading to wasted effort and suboptimal models. Different data regions have different noise levels and need different training durations, but standard early stopping treats them all the same.
- 💤Quiet2610.13901·Oct 9, 2026·~13 minstat.MLcs.LG
Hitting-Time Bounds for Asynchronous Q-Learning
Yang Peng
⭐ 0 stars / 0 repos📚 0 citesELI5A team figured out how fast standard Q-learning (a way to teach AI to make decisions) learns when it watches real-world trajectories one at a time, without restarting or replaying past experiences. They proved it needs roughly a quartic number of steps relative to the planning horizon to get accurate results.
Problem solvedQ-learning theory was incomplete for practical asynchronous setups: we didn't have tight bounds on how many real-world transitions you need to observe from a single behavior stream to reach a target accuracy, especially when the world has cycles or imbalanced state visitation.
- 💤Quiet2610.13896·Oct 9, 2026·~12 mincs.CL
Structural Automata for Neural Semantic Parsing
Xiao Zhang
⭐ 0 stars / 0 repos📚 0 citesELI5When AI systems generate meaning representations (like translating sentences to logic), they need to ensure the output follows proper structure rules. This paper uses automata (checkers that verify grammar rules on-the-fly) to guarantee valid outputs without wasting tokens on dead ends—like a spell-checker that only lets you type words that can actually finish.
Problem solvedNeural semantic parsers often generate invalid outputs that violate scope and reference rules, wasting compute and requiring expensive post-processing. With strict token limits, models run out of room before completing valid structures. This paper ensures outputs are always finishable and well-formed, improving accuracy without rollback penalties.
- 💤Quiet2610.13895·Oct 9, 2026·~14 mincs.CLcs.AI
Task Context Shapes Component Roles in Language Models
Sovesh Mohapatra, Dani S Bassett
⭐ 0 stars / 0 repos📚 0 citesELI5When a language model switches between different tasks, its internal components don't change, but they start reading and processing different information and talking to each other differently. This work maps out how those internal conversations shift based on what task you're asking the model to do.
Problem solvedWe don't understand how language models reuse the same internal parts for different tasks—just knowing a head is shared doesn't explain what it's actually doing. Being able to predict and map these task-dependent shifts could help us edit model behavior without accidentally breaking other capabilities.
- 💤Quiet2610.13889·Oct 9, 2026·~9 mincs.AIcs.IR
RATED: Reliability-Aware AI Agent Tool Retrieval via Execution Dynamics
Weiliang Chen, Song Liao
⭐ 0 stars / 0 repos📚 0 citesELI5When AI agents call external tools (like APIs), they need to pick the right one. This work makes tool selection smarter by watching which tools actually work in real-time and adjusting recommendations on the fly, instead of just picking based on semantic match.
Problem solvedAI agents fail silently when they pick unavailable or broken tools. Existing retrievers only look at semantic relevance and ignore whether tools are actually working right now, causing agents to make bad choices during execution.
- 💤Quiet2610.13886·Oct 9, 2026·~13 mincs.AI
X-AgentRed: Red-Teaming Personal Agents in Evolving Multi-Service Ecosystems
Yeonsung Jung, Zhiyuan Wang, Zifan Wang, Vítor Albiero, +4
⭐ 0 stars / 0 repos📚 0 citesELI5Researchers built a system that automatically tests AI agents connected to many web services (like email, calendar, banking) to find ways they could cause unintended harm—like accidentally deleting important data across multiple apps when following a seemingly innocent user request. It learns from failed attempts to get better at discovering new dangerous combinations.
Problem solvedAs AI agents gain access to real services and tools, they can cause real harm through unexpected interactions across apps—but existing red-teaming methods miss novel dangerous combinations because they're biased toward familiar patterns. Teams need a systematic way to find these hidden compositional failures before deploying agents in production.
- 💤Quiet2610.13881·Oct 9, 2026·~9 mincs.LG
Prediction Is Not a Sufficient Memory State
Robert Jenkinson Alvarez
⭐ 0 stars / 0 repos📚 0 citesELI5This paper proves that a system's ability to make good predictions doesn't mean it has remembered enough to learn from future data — you need extra 'hidden state' beyond just the current prediction. For polynomial losses, the paper calculates exactly how much hidden memory you need.
Problem solvedMachine learning systems often discard information after making a prediction, assuming the prediction captures everything needed. This paper shows that's wrong: you lose the ability to adapt to new observations efficiently, even if current predictions are perfect. Understanding this gap matters for designing systems that can keep learning.
- 💤Quiet2610.13871·Oct 9, 2026·~12 mincs.LG
Partially Informed Stochastic Optimization via Zeroth-Order Residual Tracking
El Mahdi Chayti, Alireza Mirrokni, Martin Jaggi
⭐ 0 stars / 0 repos📚 0 citesELI5This paper solves optimization problems where you can only see part of the gradient directly—imagine trying to optimize a system where some feedback is hidden and you have to guess it from expensive experiments. The method cleverly reuses guesses from past experiments to make new guesses cheaper and more accurate.
Problem solvedMany real-world problems (like routing systems, machine learning on shifting data, or nested optimization) hide part of their gradient information. Previous methods were wasteful because they treated each expensive function evaluation independently, even though patterns from past evaluations could help. This wastes compute and samples.
- 💤Quiet2610.13851·Oct 9, 2026·~8 minstat.MLcs.LG
Finite-Sample Guarantees for Fully Discrete Conditional Diffusion Models
Qiuyun Zhu
⭐ 0 stars / 0 repos📚 0 citesELI5This paper proves that conditional diffusion models (AI systems that generate data based on conditions) can produce good results even when trained on limited data and run for only a finite number of steps. It shows mathematically how many samples you need and how many denoising iterations are required to get reliable outputs.
Problem solvedBefore this, nobody knew if conditional diffusion models had theoretical guarantees about their accuracy when trained on real datasets with limited samples. This work proves they actually converge to the right answer at predictable rates, which matters for practitioners deciding if these models are reliable enough for production.
- 💤Quiet2610.13844·Oct 9, 2026·~7 mincs.LG
Inference-Time Steering Across Scaffolds and Epitopes for Sample-Efficient De Novo Nanobody Design
Mason Minot, Simon Friedensohn, Cédric R. Weber
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of committing to one antibody design setup upfront, this method dynamically shifts computational effort between different designs during generation—like reallocating your budget mid-project toward the paths that are actually working. It generates 5× more usable antibodies per GPU.
Problem solvedAntibody design currently wastes compute on unpromising scaffold or target choices locked in at the start. This lets you pivot between design strategies in real-time, automatically spending more GPU time on high-yield configurations rather than grinding through predetermined setups.
- 💤Quiet2610.13841·Oct 9, 2026·~6 mincs.LGcs.SE
Returning to Development States: When Full Sandbox Snapshots Help Coding Agents
Daniel Thi Graviet, Tanmay Shah
⭐ 0 stars / 0 repos📚 0 citesELI5When coding agents hit a dead end, instead of starting from scratch, this paper saves the entire machine state (like a video game checkpoint) and tries different fixes from there. It found that rewinding to earlier checkpoints helps agents solve problems faster, especially when they've spun up databases or services that can't be rebuilt from code alone.
Problem solvedCoding agents waste time restarting from zero after failures, losing all progress like database setups or running services. By recovering to saved machine states and branching from there, agents can retry more efficiently and solve multi-service coding tasks that would otherwise require complete restarts.
- 💤Quiet2610.13840·Oct 9, 2026·~14 mincs.AIcs.CLcs.CY
Studying Comics at Scale with Artificial Intelligence: The PAGE Framework and Three Studies of American Comics and Japanese Manga
Emilio Ferrara
⭐ 0 stars / 0 repos📚 0 citesELI5A system that automatically reads thousands of comic books and manga, breaking them into panels, extracting text, and analyzing what's drawn (characters, composition, who's speaking) so researchers can study trends across entire archives instead of one book at a time.
Problem solvedComics scholarship has been limited to analyzing individual books by hand; this unlocks the ability to study hundreds of thousands of pages at scale, spot historical patterns in how media portrayed power, track artistic styles across industries, and make archives searchable and accessible to blind readers.
- 💤Quiet2610.13835·Oct 9, 2026·~9 mincs.LG
Specialists Learn Faster: Knowledge Organization in Pre-training Shapes Knowledge Update Efficiency
Sheng Zhao, Yuhao Zhu
⭐ 0 stars / 0 repos📚 0 citesELI5Models trained on data ordered by time (seeing old facts, then new facts) become specialists that learn updates faster than models trained on randomly shuffled data. It's like a brain that organizes memories by when they happened—it can incorporate new info more efficiently.
Problem solvedLanguage models need to learn new information after training, but doing so efficiently is hard. This work shows that how you organize data during initial training dramatically affects how quickly models can absorb updates later—a practical way to make continual learning faster.
- 💤Quiet2610.13834·Oct 9, 2026·~14 mincs.LG
On the Design Space of Continuous Diffusion Language Models
Oscar Davis, Daan Roos, Alice Bizeul, Amitis Shidani, +4
⭐ 0 stars / 0 repos📚 0 citesELI5Researchers figured out what makes continuous diffusion models work better for text by studying two key tricks: self-conditioning (showing the model messy, partially-decoded text during training to match what happens at test time) and fixing embedding geometry so the model doesn't get confused by very noisy versions of words.
Problem solvedContinuous diffusion for text has been slower to develop than for images because we didn't know which design choices actually matter. This work provides concrete techniques to make text diffusion models faster and more accurate without extra computational cost.
- 💤Quiet2610.13832·Oct 9, 2026·~11 mincs.CVcs.AI
SpatialASM: Internalizing Active Mentalization for Spatial Reasoning
Yuhong Liu, Shenxi Wu, Junyi Chi, Beichen Zhang, +4
⭐ 0 stars / 0 repos📚 0 citesELI5This work teaches vision-language models to mentally rotate and view scenes from different angles when solving spatial puzzles—like how humans naturally turn their heads to understand 3D layouts. It uses training data showing these viewpoint-switching strategies.
Problem solvedLVLMs struggle with spatial reasoning tasks requiring 3D understanding and perspective-taking because they can't internally simulate how scenes look from different viewpoints. This limits their ability to solve tasks needing mental rotation, cross-view reasoning, or viewpoint transformation.
- 💤Quiet2610.13829·Oct 9, 2026·~13 mincs.ROcs.AI
MC-EvoBench: Auditing Experience-Driven Self-Improvement in Minecraft Agents
Jingwei Song, Zhisheng Chen, Bingfan Zeng, Jing Tang, +4
⭐ 0 stars / 0 repos📚 0 citesA central challenge in embodied recursive self-improvement is enabling agents to convert interaction history into capabilities that persist beyond one world and transfer to later tasks. A saved memory or successful final action does not by itself establish that a reusable capability was acquired; evaluation must separa…
- 💤Quiet2610.13826·Oct 9, 2026·~7 mineess.AScs.CLcs.SD
OpenPA: Forced-alignment-free Multi-granular Pronunciation Assessment with Mixed-transcript Adaptation
Fu-An Chao, Bi-Cheng Yan, Berlin Chen
⭐ 0 stars / 0 repos📚 0 citesRecent advances in automatic pronunciation assessment (APA) have driven a shift from scripted to free-form assessment. However, existing methods often rely on multi-stage pipelines with forced alignment and separate feature extractors, limiting their practicality across response settings. In light of this, we propose O…
- 💤Quiet2610.13823·Oct 9, 2026·~13 mincs.DBcs.AI
Same Query, Different Answer: Run-to-Run Variance in Semantic Query Processing
Oktie Hassanzadeh, Dharmashankar Subramanian
⭐ 0 stars / 0 repos📚 0 citesSemantic query engines ask a large language model (LLM) to judge individual rows, and benchmarks compare these engines on the quality of a few executions at temperature 0. We measure how much another execution changes. We re-execute the text and tabular workloads of SemBench, LRO-Bench, and UDA-Bench through their own…
- 💤Quiet2610.13821·Oct 9, 2026·~9 mincs.CL
Can Language Models Learn When to Abstain? Policy Learning and Calibrated Answer Selection
Juan Terven, Diana-Margarita Córdova-Esparza, Ruben Gomez, Carlos Miranda Rocha, +2
⭐ 0 stars / 0 repos📚 0 citesA useful language model should know when to answer and when to say "I don't know." Can we improve that decision by training the model itself or by training a separate component to check its answers? We study both approaches on Qwen3-14B for factual questions, using a score that rewards correct answers, penalizes mistak…
- 💤Quiet2610.13819·Oct 9, 2026·~7 mincs.LG
Shared Canonical Component Removal Beyond Expert Views
Jose Roberto Tello Ayala, Akl C. Fahed, Roy Perlis, Finale Doshi-Velez
⭐ 0 stars / 0 repos📚 0 citesIn clinical practice, experts often begin by converting raw inputs into a set of expert features before making a decision. While black-box models trained on raw input can outperform models trained on expert views, it remains unclear what predictive signal the raw model exploits beyond what the expert view captures. We…
- 💤Quiet2610.13818·Oct 9, 2026·~8 mincs.LG
TabMF: Learning Dataset Representations with Tabular Foundation Models
Rafiq Kamel, Nicolas Atienza, Aziz Fouché, Nicola Cancedda, +1
⭐ 0 stars / 0 repos📚 0 citesRepresentations of supervised datasets support higher-level machine-learning tasks such as dataset retrieval and distribution-shift monitoring. However, existing approaches typically rely either on hand-crafted meta-features or on dataset encoders trained specifically for representation learning. We introduce TabMF, a…
- 💤Quiet2610.13816·Oct 9, 2026·~14 mincs.ROcs.CVcs.LG
Dream to Remember: Continual Steering of Generalist Robot Policies with World Models
Bahey Tharwat, Iman Nematollahi, Marvin Alles, Xingyuan Zhang, +2
⭐ 0 stars / 0 repos📚 0 citesGeneralist robot policies are trained with imitation learning and are bounded by the quality and coverage of their demonstrations. Reinforcement learning can improve and extend them, either by fine-tuning the policy weights or by training a small module to steer the input noise of a frozen generative policy. When tasks…
- 💤Quiet2610.13812·Oct 9, 2026·~12 mincs.LGcs.CV
Spanning Diffusion and Flow-based Posterior Sampling via Exact Gaussian Conditioning
Teo Deveney, Lea Bogensperger, Hok Shing Wong
⭐ 0 stars / 0 repos📚 0 citesFlow-matching and diffusion models are increasingly used as priors for linear inverse problems, however, most methods are bespoke to one class of trajectory prior. Plug-and-play methods have been proposed, however these implicitly decorrelate the guided trajectory, resulting in broad priors that can struggle when data…
- 💤Quiet2610.13811·Oct 9, 2026·~12 mincs.LGcs.CLquant-ph
QTestBench: A Test Framework for Evaluating LLM-Generated Quantum Code
Meriem Terki, Nouhaila Innan, Minghao Shao, Muhammad Kashif, +2
⭐ 0 stars / 0 repos📚 0 citesLarge language models (LLMs) have shown strong results in classical code generation and are increasingly used to write the unit tests that safeguard that code. Whether they can do the same for quantum software is less clear, because quantum programs are probabilistic, depend on numerical tolerances, and are judged by d…
- 💤Quiet2610.13810·Oct 9, 2026·~14 mincs.IRcs.CL
Tracing and Taming Hallucinated Terms via Subsequence-Association Filtering and Breadth-Aware Selection for LLM Query Expansion
Amit Kumar Jaiswal, Sagar Uprety, Prayag Tiwari
⭐ 0 stars / 0 repos📚 0 citesLarge language models (LLMs) are now a standard source of query expansion terms but they hallucinate. They inject non existent entities and off-topic terms that add ranking noise and can hurt strong retrievers. Existing remedies such as corpus grounding, mutual verification and preference alignment treat hallucinated t…
- 💤Quiet2610.13808·Oct 9, 2026·~8 minquant-phcs.LG
Diversity-Aware Ensemble of Quantum-Classical Models via Combinatorial Fusion
Jingyan Xu, Yuanhong Wu, Samuel Yen-Chi Chen, Sean Patten, +2
⭐ 0 stars / 0 repos📚 0 citesVariational quantum circuits (VQCs) are highly sensitive to circuit architecture, yet most quantum machine learning pipelines select a single best design and discard the remaining candidates. This paper addresses whether the structural diversity across quantum circuit search spaces can be used to produce stronger predi…
- 💤Quiet2610.13807·Oct 9, 2026·~11 mincs.CL
Error Rate is Not Enough: Costs of Augmentation in Low-Resource ASR
Katsumi Ibaraki, David Chiang
⭐ 0 stars / 0 repos📚 0 citesData augmentation is standard practice for low-resource automatic speech recognition (ASR), but its benefits are almost always reported as aggregate error rates, leaving open why and when a method helps. On four low-resource languages and English at five data sizes, we cross two augmentations that modify existing audio…
- 💤Quiet2610.13806·Oct 9, 2026·~15 mincs.LGcs.AI
FORTE: A Production Framework for Feature Evaluation and Deprecation in Industrial Recommender Systems
Vishnu Arun, Adam Obeng, Tianyou Wang, Zilin Ren, +6
⭐ 0 stars / 0 repos📚 0 citesProduction recommender systems have feature-lifecycle asymmetry: adding new features must produce gains on some metric, while feature removal must not regress any metric. In practice, feature deprecation is hard to prioritize as a feature can fail to be removed if it interacts with other features, its importance change…
- 💤Quiet2610.13804·Oct 9, 2026·~13 minstat.MLcs.LGmath.NA
Constrained Probabilistic Numerics: Gaussian Process Solvers for Linear PDEs under Linear Inequality Constraints
Boyuan Deng, Kshitiz Upadhyay, Michael Shields
⭐ 0 stars / 0 repos📚 0 citesGaussian process solvers for linear partial differential equations (PDEs) return posteriors rather than point estimates, but they condition only on equality information: the PDE residual, boundary data, and measurements. Many solutions of interest also obey inequality constraints, including nonnegativity, monotonicity,…
- 💤Quiet2610.13799·Oct 9, 2026·~11 minmath.OCcs.LG
Adaptive Variance Reduction without Knowing Oracle Smoothness
Wei Jiang, Yibo Wang, Zechao Li
⭐ 0 stars / 0 repos📚 0 citesVariance reduction improves the convergence rate of stochastic non-convex optimization under the average smoothness condition. Existing adaptive variance reduction methods are especially designed for average smoothness and do not adapt to standard smoothness. In this paper, we study how one algorithm can adapt to these…
- 💤Quiet2610.13797·Oct 9, 2026·~12 mincs.CL
REFLECT: Role-Aware Detection of Sentiment, Emotion, Politeness, and Formality
Sangpil Youm, Annabel Stocks Natalias, Hayden Heninger, Leah Jones, +3
⭐ 0 stars / 0 repos📚 0 citesDetecting communicative meaning in dialogue requires modeling not only lexical content but also the participant-role structures through which sentiment, emotion, politeness, and formality (SEPF) are expressed. Existing approaches rely on contextual language representations while leaving semantic roles implicit. We intr…
- 💤Quiet2610.13794·Oct 9, 2026·~11 mincs.CL
Not Just an Evaluation: A Case Study of Discourse Particle Sensitivity in Language Models
William Sheffield, Jiahui Chen, Amy Zhang, Alex Warstadt, +2
⭐ 0 stars / 0 repos📚 0 citesDiscourse particles subtly shape the flow of discourse by reflecting conversational context and interlocutor attitudes, often leaving the truth-conditional meaning untouched. They are also often polyfunctional, with distinct senses which partially overlap with other particles; for example, the exclusive use of English…
- 💤Quiet2610.13790·Oct 9, 2026·~13 mincs.CVcs.CL
OccludeBench: Can VLMs Find What's Missing?
Jasin Cekinmez, Addison J. Wu, Ryo Mitsuhashi, Linrong Cai, +2
⭐ 0 stars / 0 repos📚 0 citesHow well can vision-language models (VLMs) reason about what is missing from an image? We study this question with OccludeBench, a manually curated benchmark for recovering fully occluded objects from the visual evidence that remains. OccludeBench distinguishes direct cases, where the hidden object must be recovered fr…
- 💤Quiet2610.13789·Oct 9, 2026·~9 mincs.LGmath.OC
Randomized Momentum Transport with Cheap Predictors
El Mahdi Chayti, Martin Jaggi
⭐ 0 stars / 0 repos📚 0 citesMomentum methods such as STORM and second-order momentum track the gradient by adding a transport correction to momentum, at the cost of an extra oracle call per iteration. We introduce randomized momentum transport, which evaluates the correction with probability $q$ and otherwise uses a cheap prediction, with importa…
- 💤Quiet2610.13787·Oct 9, 2026·~9 minmath.OCcs.LG
Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints
Gon Buzaglo, Guy Kornowski
⭐ 0 stars / 0 repos📚 0 citesWe present new algorithms for stochastic optimization problems in which the objective is neither smooth nor convex, subject to a convex constraint set. Our algorithms return a $(δ,\varepsilon)$-Goldstein stationary point, as recently defined for constrained problems by Liu et al. (2024), with improved complexities, and…
- 💤Quiet2610.13786·Oct 9, 2026·~11 mincs.LGcs.AI
Your Discrete Graph Diffusion Model is Secretly Memorizing
Adarsh Jamadandi, Nicolas Keriven
⭐ 0 stars / 0 repos📚 0 citesDiscrete graph diffusion models (GDMs) corrupt the graph structure by adding noise independently to nodes and edges under a Markovian noise model. In the unconditional setting without node features, an equivariant denoiser trained on a single graph is able to generate novel graphs and sample-level metrics such as edge…
- 💤Quiet2610.13783·Oct 9, 2026·~6 mincs.AIcs.CLcs.CV
UkrMeme: Multimodal Explainable Persuasion Detection in Ukrainian Memes
Nazar Andrushko, Vera Schmitt, Veronika Solopova
⭐ 0 stars / 0 repos📚 0 citesMemes play a central role in modern online communication, especially in contexts of political conflict where visual and textual cues combine to convey persuasive messages. We study persuasive technique detection in Ukrainian memes using vision-language models (VLMs). We introduce UkrMeme, a dataset of 200 organically p…
- 💤Quiet2610.13778·Oct 9, 2026·~11 mincs.LGcs.AI
ReplaySSM: Cache SSM Inputs, Not State
Ze-Wei Liou, Harris Nover, Amey Naik, Andrii Skliar, +3
⭐ 0 stars / 0 repos📚 5 citesState-space models (SSMs) maintain a fixed-size recurrent state, but reading and writing it at every decoding step can bottleneck hybrid models. This eager state management causes large state I/O with low arithmetic intensity, leaves speculative decoding no cheap rollback, and feeds state quantization error into subseq…
- 💤Quiet2610.13773·Oct 9, 2026·~10 minmath.OCcs.LG
Geometry-Aware Multi-Objective Optimization: Norm-Constrained Oracles with Entropic Weight Updates
El Mahdi Chayti, Alireza Mirrokni, Martin Jaggi
⭐ 0 stars / 0 repos📚 0 citesMultiple-gradient descent is typically formulated in Euclidean geometry, whereas matrix-aware optimizers use directions induced by other norms. We analyze a single-loop multi-objective method combining a norm-constrained linear minimization oracle with entropic updates of task weights. For any finite-dimensional norm p…
- 💤Quiet2610.13768·Oct 9, 2026·~13 minstat.MLcs.LG
From Pixels to Privacy-Sensitive Features: An Information-Theoretic Framework for Reconstruction Bounds
Henry Bourne, Robert F. Allison
⭐ 0 stars / 0 repos📚 0 citesWhat can an adversary recover from a model trained with DP-SGD? Its $(\varepsilon,δ)$ guarantee does not answer this question directly. We derive a distortion bound that can be computed before training and applies even to an adversary who observes the parameter trajectory during training, knows every other training rec…