English
Related papers

Related papers: $\lambda$-Regularized A-Optimal Design and its App…

200 papers

The sparse portfolio selection problem is one of the most famous and frequently-studied problems in the optimization and financial economics literatures. In a universe of risky assets, the goal is to construct a portfolio with maximal…

Optimization and Control · Mathematics 2022-02-22 Dimitris Bertsimas , Ryan Cory-Wright

We propose a simple subsampling scheme for fast randomized approximate computation of optimal transport distances. This scheme operates on a random subset of the full data and can use any exact algorithm as a black-box back-end, including…

Computation · Statistics 2020-12-17 Max Sommerfeld , Jörn Schrieber , Yoav Zemel , Axel Munk

We study algorithms using randomized value functions for exploration in reinforcement learning. This type of algorithms enjoys appealing empirical performance. We show that when we use 1) a single random seed in each episode, and 2) a…

Machine Learning · Computer Science 2022-10-14 Zhihan Xiong , Ruoqi Shen , Qiwen Cui , Maryam Fazel , Simon S. Du

Motion planning under differential constraints is a classic problem in robotics. To date, the state of the art is represented by sampling-based techniques, with the Rapidly-exploring Random Tree algorithm as a leading example. Yet, the…

Robotics · Computer Science 2015-03-03 Edward Schmerling , Lucas Janson , Marco Pavone

We study the fundamental problem of high-dimensional mean estimation in a robust model where a constant fraction of the samples are adversarially corrupted. Recent work gave the first polynomial time algorithms for this problem with…

Machine Learning · Computer Science 2018-11-26 Yu Cheng , Ilias Diakonikolas , Rong Ge

Optimal portfolio selection problems are determined by the (unknown) parameters of the data generating process. If an investor wants to realise the position suggested by the optimal portfolios, he/she needs to estimate the unknown…

Portfolio Management · Quantitative Finance 2023-04-19 Taras Bodnar , Holger Dette , Nestor Parolya , Erik Thorsén

We study the problem of approximating the mixed volume $V(P_1^{(\alpha_1)}, \dots, P_k^{(\alpha_k)})$ of an $k$-tuple of convex polytopes $(P_1, \dots, P_k)$, each of which is defined as the convex hull of at most $m_0$ points in…

Computational Geometry · Computer Science 2025-12-30 Hariharan Narayanan , Sourav Roy

In this paper, we consider a class of continuous-time, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation methods and sampling-based algorithms for deterministic path planning,…

Robotics · Computer Science 2012-02-27 Vu Anh Huynh , Sertac Karaman , Emilio Frazzoli

We consider the problem of estimating the spectrum of a symmetric bounded entry (not necessarily PSD) matrix via entrywise sampling. This problem was introduced by [Bhattacharjee, Dexter, Drineas, Musco, Ray '22], where it was shown that…

Data Structures and Algorithms · Computer Science 2024-11-06 William Swartworth , David P. Woodruff

We consider the fundamental learning problem of estimating properties of distributions over large domains. Using a novel piecewise-polynomial approximation technique, we derive the first unified methodology for constructing sample- and…

Machine Learning · Computer Science 2020-03-18 Yi Hao , Alon Orlitsky

We study partial and budgeted versions of the well studied connected dominating set problem. In the partial connected dominating set problem, we are given an undirected graph G = (V,E) and an integer n', and the goal is to find a minimum…

Data Structures and Algorithms · Computer Science 2013-11-12 Samir Khuller , Manish Purohit , Kanthi Sarpatwar

We propose a new topic modeling procedure that takes advantage of the fact that the Latent Dirichlet Allocation (LDA) log likelihood function is asymptotically equivalent to the logarithm of the volume of the topic simplex. This allows…

Machine Learning · Statistics 2019-04-04 Byoungwook Jang , Alfred Hero

Random projection techniques based on Johnson-Lindenstrauss lemma are used for randomly aggregating the constraints or variables of optimization problems while approximately preserving their optimal values, that leads to smaller-scale…

Optimization and Control · Mathematics 2021-07-13 Terunari Fuji , Pierre-Louis Poirion , Akiko Takeda

We consider the problem of optimal recovery of an element $u$ of a Hilbert space $\mathcal{H}$ from $m$ measurements obtained through known linear functionals on $\mathcal{H}$. Problems of this type are well studied \cite{MRW} under an…

Numerical Analysis · Mathematics 2015-06-17 Peter Binev , Albert Cohen , Wolfgang Dahmen , Ronald DeVore , Guergana Petrova , Przemyslaw Wojtaszczyk

We propose Distributionally Balanced Designs (DBD), a new class of probability sampling designs that target representativeness at the level of the full auxiliary distribution rather than selected moments. In disciplines such as ecology,…

Methodology · Statistics 2026-03-13 Anton Grafström , Wilmer Prentius

We propose an algorithm to detect approximate reflection symmetry present in a set of volumetrically distributed points belonging to $\mathbb{R}^d$ containing a distorted reflection symmetry pattern. We pose the problem of detecting…

Computer Vision and Pattern Recognition · Computer Science 2019-01-16 Rajendra Nagar , Shanmuganathan Raman

We study the behavior of high-dimensional robust regression estimators in the asymptotic regime where $p/n$ tends to a finite non-zero limit. More specifically, we study ridge-regularized estimators, i.e…

Statistics Theory · Mathematics 2013-11-12 Noureddine El Karoui

Robust regression models in the presence of outliers have significant practical relevance in areas such as signal processing, financial econometrics, and energy management. Many existing robust regression methods, either grounded in…

Signal Processing · Electrical Eng. & Systems 2025-06-30 Pengyang Song , Jue Wang

In this work, we propose a novel sampling method for Design of Experiments. This method allows to sample such input values of the parameters of a computational model for which the constructed surrogate model will have the least possible…

Numerical Analysis · Computer Science 2018-10-03 V. P. Zankin , G. V. Ryzhakov , I. V. Oseledets

Reduced model spaces, such as reduced basis and polynomial chaos, are linear spaces $V_n$ of finite dimension $n$ which are designed for the efficient approximation of families parametrized PDEs in a Hilbert space $V$. The manifold…

Numerical Analysis · Mathematics 2020-08-04 Albert Cohen , Wolfgang Dahmen , Ron DeVore , Jalal Fadili , Olga Mula , James Nichols