This tutorial explains Linear Discriminant Analysis (LDA) and Quadratic Discriminant Analysis (QDA) as two fundamental classification methods in statistical and probabilistic learning. We start with the optimization of decision boundary on which the posteriors are equal. Then, LDA and QDA are derived for binary and mul...
It has been discovered that negative curvature subverts the loss landscape, specifically sectional curvature, so it has been discovered that negative curvature subverts the loss landscape, so this work expands on this and draw interconnections to negative-definite Ricci curvature.
This work introduces the first algorithm that exactly enumerates decision-tree Rashomon sets while exploiting the ordered structure of continuous features, and develops a relaxation for approximate enumeration and an anytime algorithm that progressively refines the set of candidate thresholds, producing increasingly de...
Zakk Heile, Hayden McTavish, Margo I. Seltzer et al.· 0 citations
The results indicate that diffusion noise is not merely a passive stochastic perturbation, but a learnable---and therefore potentially designable---input dimension.
Shengzhi Deng, Chenqi Ye, Yan-Ze Guo· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
This work introduces Multistage Defer Trees: a sequence of sparse decision trees that each make predictions for most samples, while deferring a small proportion to the next tree in the sequence or, ultimately, to a black box.
Zakk Heile, Hayden McTavish, Margo I. Seltzer et al.· arXiv.org· 1 citation
Discrete diffusion has become a leading framework for generative modeling in various applications including language, vision, and biology. Existing convergence theory, however, exhibits fundamental limitations. KL-based analyses diverge under singular priors such as the masked distribution, while bounds in total variat...
Kelvin Kan, Xingjian Li, Benjamin J. Zhang et al.· 0 citations
This work proposes a refined analysis of the non-consecutive gradient variation, a fundamental quantity in gradient variation with bandit feedback, and improves the dimension dependence for both convex and strongly convex functions compared with the best known results.
Hang Yu, Yu-Hu Yan, Peng Zhao· arXiv.org· 7 citations
Learning systems often expand their ambient features or latent representations over time, embedding earlier representations into larger spaces with limited new latent structure. We study transfer learning for structured matrix estimation under simultaneous growth of the ambient dimension and the intrinsic representatio...
Jinhang Chai, Xuyuan Liu, Elynn Chen et al.· 0 citations
A local-valley (LV)-centered approach to assessing the quality of sampling from Restricted Boltzmann Machines (RBMs) was applied to the latest generation of the D-Wave quantum annealer, revealing some potential for improvement, e.g., using a combined classical–quantum approach.
Abdelmoula El Yazizi, S. U. Khan, Y. Koshka· Entropy· 1 citation
We study neural architectures in which each hidden layer is defined by the stationary state of a dissipative Schr\"odinger-type dynamics on a learned latent graph. On stable branches, the local stationary problem defines a differentiable implicit graph layer. To learn the graph itself, we optimize over the stratified m...
Dmitry Pasechnyuk-Vilensky, Martin Tak\'a\v{c}· 0 citations
The long horizon forecasting (LHF) problem has come up in the time series literature for over the last 35 years or so. This review covers aspects of LHF in this period and how deep learning has incorporated variants of trend, seasonality, fourier and wavelet transforms, misspecification bias reduction and bandpass filt...
This work derives a differential equation that governs the evolution of the generalization gap when a model is trained by gradient descent-based methods and shows that the generalization gap is given by a quadratic form that consists of an ``effective Gram matrix'' that depends upon the training trajectory and a certai...
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 8, 2026