In many machine learning applications, it is necessary to guard against worst-case scenarios and predictions that could result in substantial losses. In principle, this can be achieved by training risk-averse predictive models that minimize loss functions such as conditional value-at-risk (CVaR), rather than relying on...
Tim Löhr, Paul Hofman, Maximilian Muschalik et al.· 0 citations
Flow matching has emerged as a scalable paradigm for training high-quality generative models, but sampling from the learned probability flow requires many network evaluations. Distillation can reduce this cost to one or a few evaluations; however, one-step generation often sacrifices quality, making few-step generation...
Shanchuan Lin, Yan-Song Peng, Fu-Yun Wang et al.· 0 citations
Neural network-based predictive modeling with high-dimensional structured Gaussian targets requires an efficient and numerically stable, yet expressive approximation of the covariance matrix. We propose SCORE: a scalable framework, combining scoring rule training with an expressive covariance approximation learned in s...
Christopher Bulte, Emil Partow, Astha Gupta et al.· 0 citations
It is demonstrated how incorporating gradient information into the Gaussian process surrogate accelerates Bayesian optimization-based inference under a limited simulation budget and shows significant improvement in convergence speed from using gradient information.
Šimon Soldát, Václav Šmídl· International Conference on...· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
World models for control must capture which aspects of the environment respond to the agent's actions and which are relevant to reward. Generative world models such as Dreamer 4 consist of a video tokenizer, which encodes each frame into a latent, and a dynamics model, which is pretrained to predict future latents from...
Prince Jha, Nils Lukas, Kun Zhang et al.· 0 citations
Which forms of test-time compute improve the predictions of strong pretrained tabular foundation models (TFMs)? We systematically study this along three axes: adaptation, aggregation, and context construction. Our evaluation spans modern TFMs across the TabArena benchmark, supplemented by experiments on wide and large-...
Kang-Hui Ning, Marin Bilos, James T. Wilson et al.· 0 citations
Bayesian optimisation is the natural tool for shape design when objectives are expensive and non-differentiable, but it needs a compact yet expressive parameterisation of the search space. Hand-crafting one is a complex endeavour requiring domain expertise, and often yields implicit infeasible regions, artificial bound...
Gabriel Diaz-Aylwin, Joseph Neighbor, Abiel Malkani Talwar et al.· 0 citations
This paper proposes an imprecise Dirichlet model (IDM) based method to analyze the robustness of Shapley values in decision trees and random forests and shows that the proposed method can be straightforwardly generalized to the case of Banzhaf values.
Chen-Rui Zhu, Vu-Linh Nguyen, M. Masson et al.· 0 citations
High-resolution socioeconomic variables are important for applications such as urban planning, public health, disaster response, and resource allocation. In practice, however, these variables are often observed only at a coarse spatial resolution. We introduce Puffin, a probabilistic framework for statistical disaggreg...
Chaitanya Jobanputra, S. Vollmer, Gerrit Großmann· 0 citations
Assembly documentation is a downstream manufacturing artifact that is still usually authored by interpreting CAD models by hand. Structured product data and large language models are both available, yet studies of CAD interpretation, assembly sequence planning, instruction writing, and human oversight have largely proc...
Aaron Dsouza, Mohammed Azeez Khan, Ashutosh Mishra et al.· 0 citations
In deep learning, approximation theory motivates increasing representation size. We ask whether this benefit extends to dynamics learning through autoregressive prediction. We analyze the learned time evolution through the eigenstructure of Koopman operators, using relative residuals to detect spurious eigenpairs arisi...
Itsushi Sakata, Yuta Miyauchi, Yoshinobu Kawahara· 0 citations
Modern neural networks are heavily over-parameterized. This redundancy incurs substantial compute and memory overhead during training and inference. Existing pruning methods rely on post-hoc magnitude thresholds or static initialization heuristics. Consequently, they often require manual per-layer sparsity targets or e...
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
MIT News · Artificial Intelligence· news.mit.eduOct 27, 2026
Prabha Jha used her experience with MIT Open Learning’s program for senior executives to develop AI solutions for her employer, Verizon, and to write a book.
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.