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

222445667889 · Jun 202019922001200920172026
48 results for Classical Optimization

Classical scaling is shown to be optimal under various noisy conditions.

problem Consistency of classical scaling under general noise conditions.
method Established using finite fourth moments of noise, derived convergence rates, and matching minimax lower bounds.
result Classical scaling achieves minimax optimality in recovering true configuration from noisy dissimilarities.

Diffeologies unify infinite-dimensional geometry and PDEs, enhancing classical function spaces.

problem Combining infinite-dimensional geometry and PDEs for optimization problems.
method Review and extension of classical function spaces and mapping spaces.
result Diffeologies provide a unified framework for evolution equations and optimization problems.

Study analyzes 3,171 stocks to pick efficient portfolios using quantum and classical solvers.

problem Creating efficient stock portfolios from a large dataset.
method Used classical and quantum solvers to optimize portfolios of 3,171 US stocks.
result Demonstrated the effectiveness of quantum and classical solvers in portfolio optimization.

Quantum computing improves feature selection in machine learning.

problem Optimizing feature selection in machine learning problems.
method Formulated feature selection as a QUBO problem and compared quantum and classical methods.
result Quantum computing can outperform classical methods in feature selection, depending on data set.

LLMs struggle to optimize hyperparameters efficiently, but hybrid methods can improve performance.

problem Optimizing hyperparameters of small language models using LLMs.
method Comparison of classical HPO algorithms and LLM-based methods, introducing Centaur hybrid approach.
result Hybrid Centaur approach achieves best results, outperforming classical and pure LLM methods.

The classical duality theory of Kantorovich and Kellerer for the classical optimal transport is generalized to an abstract framework and a characterization of the dual elements is provided. This abstract generalization is set in a Banach lattice X\cal{X} with a order unit. The primal problem is given as the supremum o…

2016-10-10abs ↗pdf ↗

Although optimization is the longstanding algorithmic backbone of machine learning, new models still require the time-consuming implementation of new solvers. As a result, there are thousands of implementations of optimization algorithms for machine learning problems. A natural question is, if it is always necessary to…

2019-05-31abs ↗pdf ↗

Optimal contracts are found for agents with quadratic effort costs.

problem Finding optimal contracts in principal-agent problems with quadratic effort costs.
method Modeling the problem using Hamilton-Jacobi-Bellman (HJB) equations and proving the existence of classical solutions.
result Existence of optimal contracts for agents with quadratic effort costs is proven.

D-Wave hybrid quantum-classical portfolio optimization shows classical decomposition is key, not quantum sampling.

problem Optimizing portfolios with constraints using hybrid quantum-classical methods.
method Operational decomposition audit of D-Wave's hybrid quantum-classical service on mean-variance-turnover instances.
result Classical decomposition and feasibility-aware reassembly are key to hybrid quantum-classical performance.

Portfolio turnpikes state that, as the investment horizon increases, optimal portfolios for generic utilities converge to those of isoelastic utilities. This paper proves three kinds of turnpikes. In a general semimartingale setting, the abstract turnpike states that optimal final payoffs and portfolios converge under …

2011-01-05abs ↗pdf ↗

Existing information-theoretic frameworks based on maximum entropy network ensembles are not able to explain the emergence of heterogeneity in complex networks. Here, we fill this gap of knowledge by developing a classical framework for networks based on finding an optimal trade-off between the information content of a…

2019-08-10abs ↗pdf ↗

VQAs use classical optimization to train quantum circuits, promising quantum advantage.

problem High computational cost of quantum simulations and solving large-scale problems.
method Variational Quantum Algorithms (VQAs) use classical optimizers to train parametrized quantum circuits.
result VQAs are a promising strategy for obtaining quantum advantage.

Quantum algorithm speeds up nested expectation estimation by nearly quadratically.

problem Estimating repeatedly nested expectations with quantum computing.
method Proposes a quantum algorithm achieving nearly quadratic speedup over classical methods.
result Achieves nearly quadratic speedup for RNEs, up to logarithmic factors.

Hybrid QNN-LSTM predicts financial stock market trends using quantum computing.

problem Complex temporal dependencies and market fluctuations in financial time-series forecasting.
method Custom QNN regressor with hybrid optimization strategies.
result Hybrid models integrate quantum computing into financial forecasting workflows.

This study improves quantum classifiers by optimizing data preprocessing.

problem Quantum Machine Learning advantages are not yet clearly demonstrated.
method Used Linear Discriminant Analysis (LDA) for data preprocessing.
result Variational Quantum Algorithm (VQA) outperforms classical classifiers.

Two probability distributions μμ and νν in second stochastic order can be coupled by a supermartingale, and in fact by many. Is there a canonical choice? We construct and investigate two couplings which arise as optimizers for constrained Monge-Kantorovich optimal transport problems where only supermartingales are al…

2016-09-09abs ↗pdf ↗

Optimization algorithm CoCo improves causal inference from diverse data.

problem Identifying true causal relationships from data with spurious associations.
method CoCo optimizes for causal inference using environments with invariant causal relationships.
result CoCo provides more accurate causal estimates and predictions.

AdaGrad fails to adapt to Hölder-smoothness in composite optimization problems.

problem AdaGrad's convergence rate is suboptimal for composite objectives.
method Exhibited a simple one-dimensional convex problem to highlight AdaGrad's limitations.
result AdaGrad does not achieve the classical convergence rate for Hölder-smooth objectives.

Single tree outperforms random forest in testing accuracy.

problem The challenge of improving single decision tree performance.
method Gradient-based entire tree optimization framework, scaled sigmoid approximation, numerical stability algorithm, subtree polish strategy.
result Optimized single tree outperforms classic random forest by 2.03% on average.

A novel Bayesian optimization framework tackles multi-objective constrained problems.

problem Multi-objective optimization with constraints in engineering design.
method srMO-BO-3GP framework using three stacked Gaussian processes.
result Demonstrated effectiveness on benchmark functions and real thermomechanical model.

Bayesian Optimization using Gaussian Processes is a popular approach to deal with the optimization of expensive black-box functions. However, because of the a priori on the stationarity of the covariance matrix of classic Gaussian Processes, this method may not be adapted for non-stationary functions involved in the op…

2019-05-07abs ↗pdf ↗

We introduce a variant of Shepp's classical urn problem in which the optimal stopper does not know whether sampling from the urn is done with or without replacement. By considering the problem's continuous-time analog, we provide bounds on the value function and in the case of a balanced urn (with an equal number of ea…

2019-11-27abs ↗pdf ↗

Despite the numerous advances, reinforcement learning remains away from widespread acceptance for autonomous controller design as compared to classical methods due to lack of ability to effectively tackle the reality gap. The reliance on absolute or deterministic reward as a metric for optimization process renders rein…

2019-06-03abs ↗pdf ↗

We address a long-standing open problem in risk theory, namely the optimal strategy to pay out dividends from an insurance surplus process, if the dividend rate can never be decreased. The optimality criterion here is to maximize the expected value of the aggregate discounted dividend payments up to the time of ruin. I…

2019-10-10abs ↗pdf ↗