arXiv Machine Learning

A Distributionally Robust Framework for Learned Reconstructions in Inverse Problems

arXiv:2606. 30230v1 Announce Type: cross Abstract: Learned reconstruction operators for inverse problems are typically trained under a fixed noise model, and generalize poorly when the distribution during testing differs from the one assumed during training.

arXiv Machine Learning
Jun 30

Learning from samples: inverse problems over measures

arXiv:2505. 07124v3 Announce Type: replace Abstract: We study inverse problems where an unknown potential is observed only through samples from the measure it induces by a convex variational principle.

By Francisco Andrade, Gabriel Peyr\'e, Clarice Poon
arXiv Machine Learning
Sep 1

Sensitivity-Constrained Neural Operators for Data-Efficient Forward and Inverse Modeling of Partial Differential Equation Systems

The paper introduces Sensitivity‑Constrained Neural Operators (SC‑NOs), which augment standard neural operator training with sampled Jacobian supervision from differentiable solvers or discrete adjoints. By matching selected sensitivities during training, SC‑NOs improve forward prediction accuracy and significantly enhance gradient‑based inverse reconstruction for distributed fields. Experiments on advection–diffusion, RANS–Spalart–Allmaras, high‑dimensional gridded inputs, and a shallow‑water tsunami source‑inversion case demonstrate that SC‑NOs achieve a better accuracy–cost trade‑off and enable near‑real‑time wave‑propagation forecasting from sparse observations.

By Abdolmehdi Behroozi, Chaopeng Shen, Daniel Kifer, Kathryn Lawson
arXiv Machine Learning
4d ago

Learning Distributionally Robust First-Order Methods for Convex Optimization

The paper introduces a distributionally robust method for learning hyperparameters of first‑order convex optimization algorithms. By minimizing a Wasserstein‑robust performance estimation problem over a dataset of problem instances, the approach interpolates between classical learning‑to‑optimize (L2O) and worst‑case PEP design. The authors solve the resulting problem with stochastic gradient descent, provide high‑probability risk bounds, and demonstrate that the learned algorithms outperform both worst‑case optimal and vanilla L2O baselines on logistic regression, LASSO, and linear programming tasks.

By Vinit Ranjan, Jisun Park, Bartolomeo Stellato
arXiv Machine Learning
Aug 26

Multi-Source Complex Network Reconstruction via Wasserstein Distributionally Robust Optimization and Algorithm Unrolling

The paper introduces MS‑WDRO, a multi‑source Wasserstein distributionally robust optimization framework for reconstructing complex network topologies from scarce target‑domain data and abundant heterogeneous source data. It fuses sources via a weighted Wasserstein barycenter, builds an ambiguity set around it, and solves a regularized Laplacian estimator using a provably convergent ADMM scheme. The authors provide finite‑sample guarantees, demonstrate that naive aggregation is suboptimal, and show through experiments on synthetic data and the ABIDE I neuroimaging dataset that MS‑WDRO outperforms seven baselines in graph recovery, sample efficiency, and diagnostic utility, especially when target samples are limited.

By Chuansen Peng, Yifan Xia, Jinshan Zhong, Xiaojing Shen