Moral Entropy is introduced, a Bayesian framework that keeps a full posterior over the true label and decomposes its entropy into aleatoric uncertainty (irreducible disagreement about the moral content) and epistemic uncertainty (from insufficient or noisy annotation) -- and lets any heuristic consensus rule be audited...
Open time-series forecasting (TSF) benchmarks cover retail, energy, weather, and traffic, but supply-chain logistics remains underserved. We introduce ISOMORPH, the first public digital twin of a multi-echelon logistics network with interpretable, user-configurable parameters and modular topology, demand, and control r...
Zhizhen Zhang, Hyemin Gu, Benjamin J. Zhang et al.· 0 citations
This work proposes an amortized framework for filtering and smoothing that reuses trained conditional models across observation sequences and assimilation times and shows that, under the Markov assumption, a summary sufficient for filtering is also sufficient for the backward kernel.
Tiangang Cui, Xiao-Dong Feng, Chenlong Pei et al.· 2 citations
Despite the ubiquity of multiway data across scientific domains, there are few performant and user-friendly methods that fit non-standard nonnegative tensor factorization models tailored to the data at-hand. Researchers may use gradient-based automatic differentiation, which often struggles under nonnegative constraint...
John Hood, Aaron Schein· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Sampling configurations in thermodynamic equilibrium is a long-standing challenge in statistical physics. Boltzmann generators address this problem by employing generative models to propose independent configurations, which are then reweighted via importance sampling using exact likelihood evaluations. Recent Boltzmann...
Louis Grenioux, Leonardo Galliano, Ludovic Berthier et al.· 0 citations
Machine learning models optimized for average performance can perform poorly on vulnerable subpopulations. Existing approaches often rely on groups specified in advance, yet fairness-relevant subgroup structure may be latent, intersectional, and driven by complex interactions among continuous and discrete attributes. W...
This paper considers NMF using the component-wise L1 norm as the error measure (L1-NMF), which is suited for data corrupted by heavy-tailed noise, such as Laplace noise or salt and pepper noise, or in the presence of outliers, and proposes a new coordinate descent approach for wL1-NMF, denoted as sparse CD (sCD), where...
Giovanni Seraghiti, K'evin Dubrulle, Arnaud Vandaele et al.· arXiv.org· 1 citation
The evaluation of time series forecasting models is hindered by a lack of high-quality benchmarks, leading to overestimated assessments of progress. Existing datasets suffer from issues ranging from small-scale, low-frequency, pre-training data contamination in unimodal designs to the temporal and description leakage p...
Zhijian Xu, Wanxu Cai, Xilin Dai et al.· 0 citations
This work introduces a novel inductive bias towards simple policies in reinforcement learning by minimizing the entropy of entire action trajectories, corresponding to the number of bits required to describe information in action trajectories after the agent observes state trajectories.
Bang You, Chenxu Wang, Wen-Ju Yang et al.· 0 citations
Masked discrete diffusion models are commonly accelerated using the so-called tau-leaping discretization method, which reveals several coordinates in parallel at each sampling step. The sampler replaces the joint conditional law of each revealed block by a product distribution, incurring a factorization error $\varepsi...
We consider nonparametric tangent vector field regression on a Riemannian manifold without boundary. Because responses at different points lie in different tangent spaces, the proposed kernel estimator first parallel transports nearby responses to the target tangent space and then forms a volume-corrected local average...
We develop single-loop stochastic projected damped extragradient methods for stochastic nonconvex--(strongly) concave minimax optimization, with complexity guarantees for both game stationarity (GS) and optimization stationarity (OS). Our approach combines a stochastic projected damped extragradient (SPDE) method with...
Hui-Ling Zhang, Min-hao Zhang, Zi Xu· 2 citations· ⚡1
Jennifer Neville did not want to go into computer science—but that’s exactly where she landed. Neville discusses the starts and stops that led to her professional sweet spot and her work identifying “surprising failures” making it hard for AI to handle complexity. The post What AI gets wrong and what failure teaches us appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.