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,657 papers · 148 categories

Trend · papers per month

204408611815 · Jun 202019922001200920172026
48 results for optimization criterion

New algorithms optimize a soft-robust criterion in reinforcement learning, reducing conservatism.

problem Computing robust policies for high-stakes decisions with limited data.
method Soft-robust criterion using risk measures, two algorithms for optimization.
result Our algorithms produce less conservative solutions than existing methods.

A new Bayesian optimization method tackles constrained optimization with uncertainties.

problem Optimizing functions with uncertain constraints.
method Bayesian optimization with a new acquisition criterion.
result The new criterion optimizes both objective function improvement and constraint reliability.

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 ↗

A new BO termination criterion for HPO reduces optimization time without sacrificing test performance.

problem Determining an optimal budget for hyperparameter optimization.
method A new termination criterion based on the discrepancy between predictive and computable target performance.
result The proposed termination criterion achieves a better trade-off between test performance and optimization time.

Kelly's Criterion is well known among gamblers and investors as a method for maximizing the returns one would expect to observe over long periods of betting or investing. These ideas are conspicuously absent from portfolio optimization problems in the financial and automation literature. This paper will show how Kelly'…

2017-10-01abs ↗pdf ↗

Bayesian nonparametrics improves data-driven risk optimization under distributional uncertainty.

problem Improving out-of-sample performance in machine learning models due to distributional uncertainty.
method Combining Bayesian nonparametric theory and decision-theoretic preferences to propose a robust optimization criterion.
result The proposed robust optimization procedure provides favorable statistical guarantees and tractable approximations.

Correntropy is a local similarity measure defined in kernel space and the maximum correntropy criterion (MCC) has been successfully applied in many areas of signal processing and machine learning in recent years. The kernel function in correntropy is usually restricted to the Gaussian function with center located at ze…

2019-04-13abs ↗pdf ↗

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.

In the problem of domain adaptation for binary classification, the learner is presented with labeled examples from a source domain, and must correctly classify unlabeled examples from a target domain, which may differ from the source. Previous work on this problem has assumed that the performance measure of interest is…

2018-10-03abs ↗pdf ↗

New approach to optimal dividend control with mean-variance criterion.

problem Balancing expected dividends and variability in a singular control framework.
method Game-theoretic approach to find time-consistent equilibrium strategies.
result Verification theorem for MV singular dividend control problem.

Optimized Franz-Parisi criterion matches SQ lower bounds for various statistical models.

problem Understanding computational hardness in statistical inference.
method Proposed and refined Franz-Parisi criterion, established equivalence with SQ lower bounds.
result Optimized Franz-Parisi criterion is equivalent to Statistical Query (SQ) lower bounds.

Proposes a stability evaluation criterion for learning models using distributional perturbations.

problem Ensuring reliable deployment of learning models in out-of-sample environments.
method Uses optimal transport discrepancy with moment constraints to quantify minimal perturbation required for model deterioration.
result Validates the practical utility of the stability evaluation criterion across various real-world applications.

The paper offers simple, near-optimal algorithms for multi-group learning.

problem Learning predictors within subgroups of a population, addressing fairness and hidden stratification.
method Studies the structure of solutions and provides simple, near-optimal algorithms.
result Simple and near-optimal algorithms for multi-group learning.

This paper investigates the problem of recovering missing samples using methods based on sparse representation adapted especially for image signals. Instead of l2l_2-norm or Mean Square Error (MSE), a new perceptual quality measure is used as the similarity criterion between the original and the reconstructed images. T…

2017-01-25abs ↗pdf ↗

In this paper, we study the Kelly criterion in the continuous time framework building on the work of E.O. Thorp and others. The existence of an optimal strategy is proven in a general setting and the corresponding optimal wealth process is found. A simple formula is provided for calculating the optimal portfolio for a …

2009-03-17abs ↗pdf ↗

Optimal reinsurance contracts for multiple dependent risks are derived without specific dependency assumptions.

problem Finding optimal reinsurance contracts for multiple dependent risks without assuming their dependency structure.
method Assumes maximal expected utility criterion and independent negotiation of reinsurance for each risk. Derives optimality conditions and shows that under mild assumptions, optimal contracts are classical (non-randomized) type.
result Optimal reinsurance contracts exist and can be classical (non-randomized) type under mild assumptions.

Develops a framework for cost-efficient Bayesian optimization with constraints.

problem Optimizing designs with minimal cost in constrained search spaces.
method Constrained multi-fidelity Bayesian optimization (CMFBO) with automatic stopping criterion.
result Minimizes overall sampling costs while ensuring feasibility.

In this paper, we consider the optimal portfolio liquidation problem under the dynamic mean-variance criterion and derive time-consistent solutions in three important models. We give adapted optimal strategies under a reconsidered mean-variance subject at any point in time. We get explicit trading strategies in the bas…

2015-10-30abs ↗pdf ↗

Kelly criterion, that maximizes the expectation value of the logarithm of wealth for bookmaker bets, gives an advantage over different class of strategies. We use projective symmetries for a explanation of this fact. Kelly's approach allows for an interesting financial interpretation of the Boltzmann/Shannon entropy. A…

2006-07-18abs ↗pdf ↗

The paper describes a method to infer the signal-to-noise ratio in portfolio optimization.

problem Estimating the signal-to-noise ratio in portfolio optimization problems.
method A statistic similar to the Sharpe Ratio Information Criterion is used for inference.
result The method works well for reasonable sample and asset universe sizes.

Study optimal investment-reinsurance strategy for insurers under random coefficients and jumps.

problem Optimal investment-reinsurance strategy for insurers with random coefficients and jumps.
method Solves backward stochastic differential equations with jumps under a convex cone constraint.
result Optimal strategy and value remain the same even with random coefficients and jumps.

This paper extends Kelly Criterion to include rebalancing frequency for optimal portfolio selection.

problem Optimizing a portfolio with multiple assets and varying rebalancing frequency.
method Using Kelly Criterion, the paper derives necessary and sufficient conditions for the frequency-based Kelly optimal portfolio.
result Proves the necessity and sufficiency of conditions for the frequency-based Kelly optimal portfolio.

The paper optimizes pension policies with guarantees and sustainability constraints.

problem Designing optimal pension policies with guarantees and sustainability constraints.
method Dynamic utility model, stochastic domain, overlapping generations, time-consistent decision criterion.
result Optimal investment/pension policy computed for a general framework.

The minimum error entropy (MEE) criterion has been verified as a powerful approach for non-Gaussian signal processing and robust machine learning. However, the implementation of MEE on robust classification is rather a vacancy in the literature. The original MEE only focuses on minimizing the Renyi's quadratic entropy …

2019-09-06abs ↗pdf ↗

In this paper, we study an insurer's reinsurance-investment problem under a mean-variance criterion. We show that excess-loss is the unique equilibrium reinsurance strategy under a spectrally negative Lévy insurance model when the reinsurance premium is computed according to the expected value premium principle. Furthe…

2017-03-06abs ↗pdf ↗

Framework for generating multiple clusterings from multi-view data.

problem Challenges in finding optimal clustering criteria and handling incomplete multi-view data.
method DiMVMC framework that optimizes multiple decoder deep networks to complete data views and generate shared representations.
result DiMVMC outperforms state-of-the-art competitors in generating multiple clusterings with high diversity and quality.

Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different formulations of objectives and varying regularization strategies. In this paper we present a unifying general optimization criterion for multip…

2010-05-04abs ↗pdf ↗

This paper addresses the problem of active learning of a multi-output Gaussian process (MOGP) model representing multiple types of coexisting correlated environmental phenomena. In contrast to existing works, our active learning problem involves selecting not just the most informative sampling locations to be observed …

2015-11-21abs ↗pdf ↗

When the in-sample Sharpe ratio is obtained by optimizing over a k-dimensional parameter space, it is a biased estimator for what can be expected on unseen data (out-of-sample). We derive (1) an unbiased estimator adjusting for both sources of bias: noise fit and estimation error. We then show (2) how to use the adjust…

2016-02-19abs ↗pdf ↗

Study quantifies model risk in dynamic portfolio selection using KL divergence.

problem Model risk in financial portfolio selection under uncertainty.
method Defined model risk as KL divergence loss, solved nonlinear equations for optimal robust strategy.
result Optimal robust strategy can be obtained semi-analytically in worst case scenario.

Traditional Kalman filter (KF) is derived under the well-known minimum mean square error (MMSE) criterion, which is optimal under Gaussian assumption. However, when the signals are non-Gaussian, especially when the system is disturbed by some heavy-tailed impulsive noises, the performance of KF will deteriorate serious…

2015-09-15abs ↗pdf ↗