It is proved that in-context learning extends further to data generation: frozen transformers can simulate iterative generative samplers from in-context samples, and it is proved that transformers can approximate an energy-based sampler.
Arman Adibi, Alireza Jafari, Mohammad Ghavamzadeh et al.· 0 citations
In simulations, DLNAMs generally outperformed DLNM comparators, including penalized and treed variants, in recovering known response functions, with lower bias, stronger boundary recovery, and better-calibrated cumulative intervals; gains were largest for more demanding functions.
Calle Helmersson, Shivangi Pandey, Leonardo Olivetti et al.· 0 citations
The optimal transport (OT) map provides a geometric transformation for aligning probability distributions and has become a useful tool in machine learning. However, existing estimators of the OT map still exhibit a gap between sharp statistical guarantees and practical parametric estimation based on stable training obj...
Kunwoong Kim, Insung Kong, Yongdai Kim· 0 citations
This work proposes the use of normalizing flow models to reconstruct calibration-affected weak signals by leveraging the statistical invariance of the target signals and assuming minimal initial suppression, and effectively recovers the lost signal components.
S. Yatawatta· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
It is shown that vanilla SGDA, without any modification to its update rule, can converge under heavy-tailed noise in both nonconvex-strongly-concave (NC-SC) and nonconvex-concave (NC-C) settings, establishing the first convergence guarantees for SGDA in these regimes.
Amari's contributions to information geometry and machine learning are well known. Here, we revisit Amari's work on Bayesian duality which has not received as much attention. We connect Amari's Bayesian duality to a convex duality of Bayes' rule. Using this connection, we present a generalization of Amari's Bayesian du...
Mohammad Emtiyaz Khan, Thomas M\"ollenhoff· 0 citations
B-spline regression constitutes a widely used framework for nonparametric modeling. The performance of this methodology depends on specifying the number and placement of changepoints, known as knots, prior to the estimation process. Such knot sequence determines the dimension of the B-spline basis used to represent the...
Understanding how deep neural networks learn useful internal representations from data remains a central open problem in the theory of deep learning. We introduce Neural Low-Degree Filtering (Neural LoFi), a stylized limit of gradient-based training in which hierarchical feature learning becomes an explicit iterative s...
Yatin Dandi, Matteo Vilucchio, Luca Arnaboldi et al.· 0 citations
Decision-makers rely on weather forecasts to plant crops, manage wildfires, allocate water and energy, and prepare for weather extremes. Today, such forecasts enjoy unprecedented accuracy out to two weeks thanks to steady advances in physics-based dynamical models and data-driven artificial intelligence (AI) models. Ho...
Hannah Guan, S. Mouatadid, Paulo Orenstein et al.· 1 citation
Forecasting time series accurately is critical for applications with complex data ranging from energy systems to healthcare and finance. Among current state of the art models, generative latent variable models are increasingly implemented; yet principled generalisation guarantees for modern latent variable models remai...
Chlo\'e Hashimoto-Cullen, Ghislain Agoua, Benjamin Guedj et al.· 0 citations
Dynamical symbolic regression methods identify governing differential equations from noisy data, balancing interpretability and predictive accuracy. However, standard methods often produce expressions that violate known physical laws. To address this, we propose FluxDisco, a physics-informed framework tailored for flux...
Cassandra Durr (Lancaster University), Alvaro K\"ohn-Luque (University of Oslo), Chris Jewell (Lancaster University) et al.· 0 citations
It is shown that pooling augmentations together, despite inter-dependencies, is a better alternative than the baseline of partitioning the data into subsets of independent data and provides an intuition behind the practical preference towards using many augmentations.
Maximilian Fleissner, D. Ghoshdastidar, Samory Kpotufe· 0 citations
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.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.