English
Related papers

Related papers: A new gradient-free active subspace estimation met…

200 papers

This work investigates the computational burden of pricing binary options in rare event regimes and introduces an adaptation of the adaptive multilevel splitting (AMS) method for financial derivatives. Standard Monte Carlo becomes…

Computational Finance · Quantitative Finance 2026-01-09 Riccardo Gozzo

This paper presents a physics and data co-driven surrogate modeling method for efficient rare event simulation of civil and mechanical systems with high-dimensional input uncertainties. The method fuses interpretable low-fidelity physical…

Computation · Statistics 2024-05-10 Jianhua Xian , Ziqi Wang

Training large language models (LLMs) is constrained by memory requirements, with activations accounting for a substantial fraction of the total footprint. Existing approaches reduce memory using low-rank weight parameterizations or…

Machine Learning · Computer Science 2026-04-13 Sakshi Choudhary , Utkarsh Saxena , Kaushik Roy

A new Approximate Bayesian Computation (ABC) algorithm for Bayesian updating of model parameters is proposed in this paper, which combines the ABC principles with the technique of Subset Simulation for efficient rare-event simulation, first…

Computation · Statistics 2014-04-25 Manuel Chiachio , James L. Beck , Juan Chiachio , Guillermo Rus

We consider systems of stochastic differential equations with multiple scales and small noise and assume that the coefficients of the equations are ergodic and stationary random fields. Our goal is to construct provably-efficient importance…

Probability · Mathematics 2015-09-29 Konstantinos Spiliopoulos

Stochastic gradient descent is the method of choice for large-scale machine learning problems, by virtue of its light complexity per iteration. However, it lags behind its non-stochastic counterparts with respect to the convergence rate,…

Machine Learning · Statistics 2016-03-23 Vatsal Shah , Megasthenis Asteris , Anastasios Kyrillidis , Sujay Sanghavi

Importance sampling (IS) represents a fundamental technique for a large surge of off-policy reinforcement learning approaches. Policy gradient (PG) methods, in particular, significantly benefit from IS, enabling the effective reuse of…

Machine Learning · Computer Science 2024-05-10 Matteo Papini , Giorgio Manganini , Alberto Maria Metelli , Marcello Restelli

Surrogate modeling is of great practical significance for parametric differential equation systems. In contrast to classical numerical methods, using physics-informed deep learning methods to construct simulators for such systems is a…

Numerical Analysis · Mathematics 2025-01-03 Xili Wang , Kejun Tang , Jiayu Zhai , Xiaoliang Wan , Chao Yang

Clinical decision-making often involves selecting tests that are costly, invasive, or time-consuming, motivating individualized, sequential strategies for what to measure and when to stop ascertaining. We study the problem of learning…

Machine Learning · Statistics 2026-04-16 Doudou Zhou , Yiran Zhang , Dian Jin , Yingye Zheng , Lu Tian , Tianxi Cai

Sampling-based algorithms, which eliminate ''unimportant'' computations during forward and/or back propagation (BP), offer potential solutions to accelerate neural network training. However, since sampling introduces approximations to…

Machine Learning · Computer Science 2024-02-28 Ziteng Wang , Jianfei Chen , Jun Zhu

We develop a method for the evaluation of extreme event statistics associated with nonlinear dynamical systems, using a small number of samples. From an initial dataset of design points, we formulate a sequential strategy that provides the…

Machine Learning · Computer Science 2022-06-08 Mustafa A. Mohamad , Themistoklis P. Sapsis

In this study, we propose a method Distributionally Robust Safe Screening (DRSS), for identifying unnecessary samples and features within a DR covariate shift setting. This method effectively combines DR learning, a paradigm aimed at…

We present a random-subspace variant of cubic regularization algorithm that chooses the size of the subspace adaptively, based on the rank of the projected second derivative matrix. Iteratively, our variant only requires access to…

Optimization and Control · Mathematics 2025-01-09 Edward Tansley , Coralia Cartis

In high-dimensional statistics, variable selection recovers the latent sparse patterns from all possible covariate combinations. This paper proposes a novel optimization method to solve the exact L0-regularized regression problem, which is…

Methodology · Statistics 2022-06-02 Mingzhang Yin , Nhat Ho , Bowei Yan , Xiaoning Qian , Mingyuan Zhou

Stochastic Gradient (SG) is the defacto iterative technique to solve stochastic optimization (SO) problems with a smooth (non-convex) objective $f$ and a stochastic first-order oracle. SG's attractiveness is due in part to its simplicity of…

Optimization and Control · Mathematics 2024-03-08 David Newton , Raghu Bollapragada , Raghu Pasupathy , Nung Kwan Yip

We present a new algorithm for finding a near optimal low-rank approximation of a matrix $A$ in $O(nnz(A))$ time. Our method is based on a recursive sampling scheme for computing a representative subset of $A$'s columns, which is then used…

Data Structures and Algorithms · Computer Science 2016-10-10 Michael B. Cohen , Cameron Musco , Christopher Musco

This paper applies a custom model order reduction technique to the distribution grid state estimation problem. Specifically, the method targets the situation where, due to pseudo-measurement uncertainty, it is advantageous to run the state…

Systems and Control · Electrical Eng. & Systems 2021-01-26 Samuel Chevalier , Luca Schenato , Luca Daniel

We propose a class of strongly efficient rare event simulation estimators for random walks and compound Poisson processes with a regularly varying increment/jump-size distribution in a general large deviations regime. Our estimator is based…

Probability · Mathematics 2017-06-14 Bohan Chen , Jose Blanchet , Chang-Han Rhee , Bert Zwart

We consider various stochastic models that incorporate the notion of risk-averseness into the standard 2-stage recourse model, and develop novel techniques for solving the algorithmic problems arising in these models. A key notable feature…

Data Structures and Algorithms · Computer Science 2008-05-06 Chaitanya Swamy

Numerical simulations are crucial for modeling complex systems, but calibrating them becomes challenging when data are noisy or incomplete and likelihood evaluations are computationally expensive. Bayesian calibration offers an interesting…