Stochastic gradient descent for smooth, lower-bounded, possibly nonconvex objectives under distance-dependent conditional moments is studied and unchanged SGD attains the minimax stochastic complexity in this second-moment class.
Audio language models state numbers for acoustic quantities, and neither human opinion nor a judge model says whether such a number is true of the signal. AcoustiClaim extracts each numeric claim from free text, scores it against the instrument that defines the quantity, and classes each quantity by where its reference...
Sheng-Tse Lin, Si-Yuan Zhai, Chien-Liang Kuo et al.· 0 citations
Exact Euclidean \(K\)-means partitions \(n\) observations into \(K\) unlabelled clusters, but the unrestricted search is generally exponential. We use data-derived geometric graphs to precondition an exact subset dynamic program: as a result only connected vertex subsets are admitted as clusters, while sum-of-squared-e...
Together these findings provide concrete, scanner-specific guidance for protocol optimization, with direct implications for reducing acquisition costs and improving the reliability of connectivity-based clinical biomarkers, and provide code enabling researchers to derive principled uncertainty bounds from their own dat...
Simon Carter, Ze-Ming Kuang, L. Mujica-Parodi et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
An end-to-end causal machine learning pipeline designed for real-world applications with continuous treatments that offers a more computationally efficient approach and produces less biased estimates compared to standard methods for problems with continuous treatment and high-dimensional data is presented.
Javier Moral, Clara Higuera-Cabañes, Álvaro Ibrain· 2 citations
iKFAD is a recently proposed optimiser that replaces adaptive learning rates with adaptive friction in the momentum dynamics, yet performs as well as Adam. Its limitation is that the full friction tensor $\xi\in\mathbb{R}^{m\times n}$ carries the same $\mathcal{O}(mn)$ memory overhead per layer as Adam's second-moment...
Adaptive arm selection changes the distribution of the observations collected by a bandit algorithm, but it need not change their limiting empirical spectrum. We study Gaussian bandit designs in which the dimension and the number of observations grow proportionally. A quantitative coupling theorem compares the design g...
Applied out-of-domain, the same audit recipe flags 25.5% of BIRD-financial's expert-authored gold SQLs as candidate gold-SQL issues under the authors' annotation protocol under their annotation protocol.
This work replaces attention with a stack of autoencoder-based mixing modules, one operating over local neighborhoods, one over the full sequence, and one across attention heads, each compressing and reconstructing its input through a bottleneck, and its width is a hyperparameter rather than a training effect.
Narges Mokhtari, F. Haddadi, Ebrahim Rezaii· 0 citations
Machine Learning and more specifically Deep Learning involves solving large scale nonconvex optimization problems. Several algorithms have been proposed in the literature, that seem to achieve satisfactory practical efficiency for difficult instances, the Stochastic Gradient Method being the most rudimentary, while sti...
A unified pipeline for univariate time series classification via complex networks and persistent homology is presented, showing that no single construction dominates and persistence-based features degrade gracefully under noise, consistent with the classical stability theorem of persistent homology.
In this article, we define a new non-archimedean metric structure, called cophenetic metric, on persistent homology classes of all degrees. We then show that zeroth persistent homology together with the cophenetic metric and hierarchical clustering algorithms with a number of different metrics do deliver statistically...
Exploring how generative AI could make machine vision more accessible to businesses. The post GenEye in a Box: Making Machine Vision Something You Can Just Ask For appeared first on GPT-Lab.
MIT News · Artificial Intelligence· news.mit.eduOct 7, 2026
Students in MIT’s Concourse program delve deeply into the human condition, debate challenging questions, and learn to develop judgment about issues that can’t be quantified.
Training AI agents with reinforcement learning can be challenging because their tools, context, and decision-making are managed by complex frameworks. Agent Lightning connects existing agents to RL training, making it easier to improve them without rebuilding them. The post Agent Lightning v1.0: A 3,500-Line Lightweight Agentic RL Framework for Training Agents with Real Harnesses appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 6, 2026