English
Related papers

Related papers: A black box method for solving the complex exponen…

200 papers

In this letter, we consider the problem of recovering an unknown sparse signal from noisy linear measurements, using an enhanced version of the popular Elastic-Net (EN) method. We modify the EN by adding a box-constraint, and we call it the…

Machine Learning · Computer Science 2021-07-06 Ayed M. Alrashdi , Ismail Ben Atitallah , Tareq Y. Al-Naffouri

Importance sampling is widely used in machine learning and statistics, but its power is limited by the restriction of using simple proposals for which the importance weights can be tractably calculated. We address this problem by studying…

Machine Learning · Statistics 2016-10-18 Qiang Liu , Jason D. Lee

Bayesian methods for low-rank matrix completion with noise have been shown to be very efficient computationally. While the behaviour of penalized minimization methods is well understood both from the theoretical and computational points of…

Statistics Theory · Mathematics 2015-04-08 The Tien Mai , Pierre Alquier

Matrix ellipsoids provide a standard framework for representing bounded uncertainties in data-driven control. Since noise models for sequential observations are naturally represented as the Minkowski sum of multiple matrix ellipsoids,…

Optimization and Control · Mathematics 2026-04-22 Taira Kaminaga , Hampei Sasahara

Randomized experiments are the gold standard for evaluating the effects of changes to real-world systems. Data in these tests may be difficult to collect and outcomes may have high variance, resulting in potentially large measurement error.…

Machine Learning · Statistics 2018-06-27 Benjamin Letham , Brian Karrer , Guilherme Ottoni , Eytan Bakshy

We introduce a new framework for analyzing (Quasi-}Newton type methods applied to non-smooth optimization problems. The source of randomness comes from the evaluation of the (approximation) of the Hessian. We derive, using a variant of…

Optimization and Control · Mathematics 2025-03-05 Titus Pinta

We develop approximation algorithms for set-selection problems with deterministic constraints, but random objective values, i.e., stochastic probing problems. When the goal is to maximize the objective, approximation algorithms for probing…

Data Structures and Algorithms · Computer Science 2021-11-04 Weina Wang , Anupam Gupta , Jalani Williams

We describe two quantum algorithms to approximate the mean value of a black-box function. The first algorithm is novel and asymptotically optimal while the second is a variation on an earlier algorithm due to Aharonov. Both algorithms have…

Quantum Physics · Physics 2011-06-22 Gilles Brassard , Frederic Dupuis , Sebastien Gambs , Alain Tapp

A kernel method is proposed to estimate the condensed density of the generalized eigenvalues of pencils of Hankel matrices whose elements have a joint noncentral Gaussian distribution with nonidentical covariance. These pencils arise when…

Statistics Theory · Mathematics 2015-10-02 Piero Barone

We study the problem of Trajectory Optimization (TO) for a general class of stiff and constrained dynamic systems. We establish a set of mild assumptions, under which we show that TO converges numerically stably to a locally optimal and…

Optimization and Control · Mathematics 2024-06-25 Zherong Pan , Yifan Zhu

High-probability analysis of stochastic first-order optimization methods under mild assumptions on the noise has been gaining a lot of attention in recent years. Typically, gradient clipping is one of the key algorithmic ingredients to…

An adaptation of Response Surface Methodology (RSM) when the covariate is of high or infinite dimensional is proposed, providing a tool for black-box optimization in this context. We combine dimension reduction techniques with classical…

Statistics Theory · Mathematics 2015-11-19 Angelina Roche

This thesis is interested in the application of statistical physics methods and inference to sparse linear estimation problems. The main tools are the graphical models and approximate message-passing algorithm together with the cavity…

Information Theory · Computer Science 2015-11-06 Jean Barbier

We consider the distributed version of the Multiple Knapsack Problem (MKP), where $m$ items are to be distributed amongst $n$ processors, each with a knapsack. We propose different distributed approximation algorithms with a tradeoff…

Data Structures and Algorithms · Computer Science 2017-02-06 Ananth Murthy , Chandan Yeshwanth , Shrisha Rao

In this paper, we consider a semi-linear stochastic strongly damped wave equation driven by additive Gaussian noise. Following a semigroup framework, we establish existence, uniqueness and space-time regularity of a mild solution to such…

Numerical Analysis · Mathematics 2020-08-10 Ruisheng Qi , Xiaojie Wang

In this paper, we consider a new problem of portfolio optimization using stochastic information. In a setting where there is some uncertainty, we ask how to best select $k$ potential solutions, with the goal of optimizing the value of the…

Data Structures and Algorithms · Computer Science 2024-12-03 Marina Drygala , Silvio Lattanzi , Andreas Maggiori , Miltiadis Stouras , Ola Svensson , Sergei Vassilvitskii

This paper presents a Newton-based stochastic extremum-seeking control method for real-time optimization in multi-input systems with distinct input delays. It combines predictor-based feedback and Hessian inverse estimation via stochastic…

Optimization and Control · Mathematics 2025-02-04 Paulo Cesar Souza Silva , Paulo Cesar Pellanda , Tiago Roux Oliveira

The numerical evaluation of statistics plays a crucial role in statistical physics and its applied fields. It is possible to evaluate the statistics for a stochastic differential equation with Gaussian white noise via the corresponding…

Numerical Analysis · Mathematics 2023-07-04 Jun Ohkubo

The numerical integration of stiff equations is a challenging problem that needs to be approached by specialized numerical methods. Exponential integrators form a popular class of such methods since they are provably robust to stiffness and…

Numerical Analysis · Mathematics 2024-05-15 Benjamin Carrel , Bart Vandereycken

A finite element methodology for large classes of variational boundary value problems is defined which involves discretizing two linear operators: (1) the differential operator defining the spatial boundary value problem; and (2) a Riesz…

Numerical Analysis · Mathematics 2017-12-08 Brendan Keith , Socratis Petrides , Federico Fuentes , Leszek Demkowicz