Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

0111 · Sep 201819922001200920172026
7 results for bi-criteria

New framework for resilient bi-criteria optimization under noisy feedback.

problem Bi-criteria combinatorial optimization with noisy function evaluations.
method Introducing (α,β,δ,extttN)(α,β,δ, exttt{N})-resilience and developing a black-box framework.
result Achieves sublinear regret and constraint violation for bi-criteria bandit problems.

Optimal analysis of subset-selection based L_p low rank approximation.

problem Finding a rank-k matrix X to minimize the entry-wise L_p loss of matrix A.
method Column subset selection algorithm with improved approximation ratio using Riesz-Thorin interpolation theorem.
result Improved approximation ratio for subset selection based L_p low rank approximation.

Algorithm finds safe zones in policy Markov Decision Processes to limit trajectory escape.

problem Finding safe zones in policy Markov Decision Processes to limit trajectory escape.
method Bi-criteria approximation learning algorithm with polynomial sample complexity.
result Achieves almost 2 approximation for both escape probability and safe zone size.

Efficient algorithms learn causal graphs with minimal interventions.

problem Learning causal relationships between observed variables in the presence of latents.
method Bi-criteria approximation goal combining intervention design and graph property testing.
result Achieve intervention cost within a small constant factor of the optimal.

Given a set of assets and an investment capital, the classical portfolio selection problem consists in determining the amount of capital to be invested in each asset in order to build the most profitable portfolio. The portfolio optimization problem is naturally modeled as a mean-risk bi-criteria optimization problem w…

2019-07-15abs ↗pdf ↗

Algorithm finds a subspace minimizing distances to inliers with outliers.

problem Finding a kk-dimensional subspace minimizing distances to inliers with outliers.
method Extends dimension reduction techniques and bi-criteria approximations based on sampling.
result Efficient algorithm for multiplicative (1+ε)(1+ε)-approximation of optimal solution.