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.

169,341 papers · 148 categories

Trend · papers per month

7.8%15.5%23.3%31.1% · Jun 202019922001200920182026
48 results for Optimization criteria

SPX optimizes multiple graph drawing metrics for better readability.

problem Graph drawing algorithms often optimize one metric at a time, leading to suboptimal layouts.
method Introduces Stress-Plus-X (SPX) framework that optimizes stress, crossings, angles, and upwardness simultaneously.
result SPX achieves results close to state-of-the-art algorithms that optimize metrics individually.

Proposes a multi-criteria AutoML system to optimize additional criteria like fairness and interpretability.

problem Current AutoML systems limit model choices and preprocessing steps, ignoring secondary criteria.
method Optimizes additional criteria directly to guide the search for optimal machine learning pipelines.
result Demonstrates the need and usefulness of a multi-criteria AutoML system.

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.

A game-theoretic approach to multi-criteria ranking from ordinal data.

problem Ranking objects from ordinal data with multiple criteria.
method Generalizing von Neumann winner to multi-criteria setting using Blackwell's approachability.
result The Blackwell winner can be computed as a convex optimization problem and achieves near-optimal sample complexity.

Unified perspective unites Bayesian optimization and active learning for efficient goal-oriented optimization.

problem Efficiently optimize expensive engineering and scientific problems with limited data.
method Unified framework linking Bayesian infill criteria and active learning criteria.
result Unified approach formalizes Bayesian infill criteria and active learning criteria.

This paper optimizes stock portfolios considering ESG criteria using Bayesian optimization.

problem Optimizing financial investments while incorporating ESG criteria.
method Bayesian optimization to maximize stock portfolio performance under ESG constraints.
result A scalable approach to optimize stock portfolios that balance financial performance and ESG compliance.

New method for dynamic valuation in markets with random endowments.

problem Dynamic valuation in markets with random endowments.
method Developed new FBSDE systems and established optimality conditions.
result Established necessary and sufficient conditions for optimality.

A new method minimizes experimental design regret for various optimality criteria.

problem Optimizing experimental design points for statistical efficiency.
method Regret minimization framework for polynomial-time approximation.
result Achieves (1+ε)(1+\varepsilon) approximation with O(p/ε2)O(p/\varepsilon^2) design points.

Study tackles criterion collapse in learning criteria, showing conditions for loss minimization.

problem Criterion collapse in optimization, focusing on error probability minimizers.
method Analyzes various learning criteria, including DRO, OCE risks, and non-monotonic criteria.
result Non-monotonic criteria can avoid collapse, while monotonic ones cannot.

New optimization criteria improve variational autoencoders for clearer images and latent features.

problem Improving clarity and informativeness of variational autoencoders' latent features and samples.
method Proposed new optimization criteria and a sequential VAE model.
result New criteria help generate clearer images and more informative latent features.

New algorithms improve experimental design efficiency and approximation quality.

problem Finding optimal subset of vectors for expensive measurements.
method Bayesian experimental design using determinantal point processes.
result Developed efficient algorithms for optimal design under multiple criteria.

We consider the problem of identifying patterns in a data set that exhibit anomalous behavior, often referred to as anomaly detection. In most anomaly detection algorithms, the dissimilarity between data samples is calculated by a single criterion, such as Euclidean distance. However, in many cases there may not exist …

2011-10-17abs ↗pdf ↗

The ultimate goal of optimization is to find the minimizer of a target function.However, typical criteria for active optimization often ignore the uncertainty about the minimizer. We propose a novel criterion for global optimization and an associated sequential active learning strategy using Gaussian processes.Our crit…

2012-02-09abs ↗pdf ↗

Optimizes decision-making with uncertain variables using auxiliary observations.

problem Contextual stochastic optimization problems with uncertain variables and rich auxiliary observations.
method Trains forest decision policies by growing trees that optimize downstream decision quality, using optimization perturbation analysis for efficient approximations.
result Proves asymptotic optimality and empirical validation of the method's performance and efficiency.

In this paper we consider the problem of Gaussian process classifier (GPC) model selection with different Leave-One-Out (LOO) Cross Validation (CV) based optimization criteria and provide a practical algorithm using LOO predictive distributions with such criteria to select hyperparameters. Apart from the standard avera…

2012-06-26abs ↗pdf ↗

Managing risk in dynamic decision problems is of cardinal importance in many fields such as finance and process control. The most common approach to defining risk is through various variance related criteria such as the Sharpe Ratio or the standard deviation adjusted reward. It is known that optimizing many of the vari…

2012-06-27abs ↗pdf ↗

Assume (1) asset returns follow a stochastic multi-factor process with time-varying conditional expectations; (2) investments are linear functions of factors. This paper calculates asymptotic joint moments of the logarithm of investor's wealth and the factors. These formulas enable fast computation of a wide range of i…

2003-04-11abs ↗pdf ↗

New method speeds up model selection for complex scientific tasks.

problem Exhaustive model selection is computationally infeasible for large model spaces.
method Branch-and-bound algorithm with non-monotonic criteria.
result Guaranteed identification of optimal models with significant computational speedups.

This work tackles the exploration-exploitation dilemma in RL by developing optimal policies that are inherently exploration-conscious.

problem The exploration-exploitation tradeoff in Reinforcement Learning, where policies need to balance new action exploration with past experience exploitation.
method Developed exploration-conscious criteria that result in optimal policies, solving these criteria by solving a surrogate Markov Decision Process.
result Demonstrated superior performance of exploration-conscious RL algorithms compared to non-exploration-conscious counterparts in both discrete and continuous action spaces.

Unified framework for risk-aware policy learning in contextual bandits.

problem Optimizing decision rules in high-stakes domains with adverse outcomes.
method Distributional framework for Lipschitz-continuous risk functionals, with novel empirical concentration inequalities.
result Data-dependent suboptimality bounds with an ildeO(1/n) ilde{\mathcal{O}}(1/\sqrt{n}) rate, matching risk-neutral offline policy optimization.

In a Markovian stochastic volatility model, we consider financial agents whose investment criteria are modelled by forward exponential performance processes. The problem of contingent claim indifference valuation is first addressed and a number of properties are proved and discussed. Special attention is given to the c…

2011-09-18abs ↗pdf ↗

Introduces new performance criteria for investment under distorted probabilities.

problem Reconciling time-consistent performance with probability distortions.
method Two definitions of forward rank-dependent criteria, equivalence established; characterization of viable probability distortion processes.
result Characterization of optimal wealth process and new distorted measure.

This paper optimizes multi-layer reinsurance policies to minimize risk measures.

problem Minimizing risk for insurance companies with multiple layers of reinsurance.
method Generalizes optimal stop-loss reinsurance to multi-layer policies using conditional tail expectation (CTE) risk measure.
result An optimal multi-layer reinsurance policy can be derived and estimated.

The construction of efficient and effective decision trees remains a key topic in machine learning because of their simplicity and flexibility. A lot of heuristic algorithms have been proposed to construct near-optimal decision trees. ID3, C4.5 and CART are classical decision tree algorithms and the split criteria they…

2015-11-25abs ↗pdf ↗

Inference-aware meta-alignment of LLMs reduces computational cost.

problem Aligning LLMs to diverse human preferences is challenging due to conflicting criteria.
method IAMA trains a base model to be aligned to multiple tasks via different inference-time alignment algorithms, using non-linear GRPO for optimization.
result IAMA enables effective alignment of LLMs to multiple criteria with limited computational budget.

Suggests stopping criteria for feature selection using mutual information.

problem Automatic determination of optimal feature subset size and stopping criterion.
method Monitoring conditional mutual information (CMI) among groups of variables using Renyi's α-entropy.
result Easy to implement stopping criteria for feature selection.

The paper optimizes designs for distinguishing between Gaussian process models.

problem Discriminating between two Gaussian process models.
method Sequential and static design criteria, including Kullback Leibler divergences and log-likelihood ratios.
result Necessary conditions for optimal design measures are provided.

Model selection based on classical information criteria, such as BIC, is generally computationally demanding, but its properties are well studied. On the other hand, model selection based on parameter shrinkage by 1\ell_1-type penalties is computationally efficient. In this paper we make an attempt to combine their st…

2013-07-08abs ↗pdf ↗

We consider a discrete-time, generically incomplete market model and a behavioural investor with power-like utility and distortion functions. The existence of optimal strategies in this setting has been shown in a previous paper under certain conditions on the parameters of these power functions. In the present paper w…

2014-05-15abs ↗pdf ↗

Transforms game optimization dynamics into frequency domain for precise hyperparameter analysis.

problem Analyzing convergence of hyperparameters in game optimization.
method Frequency-domain framework using High-Resolution Differential Equations (HRDEs) and Laplace transforms.
result Derives precise convergence criteria for the Lookahead algorithm.

vsOED optimizes experiment design with reinforcement learning for Bayesian models.

problem Optimizing the sequence of experiments in Bayesian models for efficient data collection.
method Reinforcement learning with variational posterior approximations to optimize design policy.
result vsOED achieves superior sample efficiency compared to existing methods.

Innovative game theory approach optimizes survival analysis metrics.

problem Survival analysis models trained with maximum likelihood do not directly optimize criteria like Brier score or Bernoulli log likelihood.
method Inverse-Weighted Survival Games: Construct objectives from re-weighted estimates featuring the other model, holding the latter fixed during training.
result Games optimize Brier score on simulations and real-world data.