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

206411617822 · Jun 202019922001200920172026
48 results for automated optimization

Automated HPO design using Bayesian optimization and benchmarking.

problem Designing effective hyperparameter optimization algorithms is manual and lacks systematic understanding.
method Formalized space of HPO candidates, Bayesian optimization for search, ablation analysis.
result Simple configurations can perform well in HPO, especially with right parameters.

Automated machine learning (AutoML) aims to find optimal machine learning solutions automatically given a machine learning problem. It could release the burden of data scientists from the multifarious manual tuning process and enable the access of domain experts to the off-the-shelf machine learning solutions without e…

2019-07-21abs ↗pdf ↗

New models optimize quotes for automated market makers considering various price dynamics and demand variability.

problem Optimizing quotes for automated market makers in volatile price environments.
method Advanced models incorporating stochastic volatility, jumps, Hawkes processes, and Markov-modulated Poisson processes.
result Optimal quotes can be computed using numerical methods tailored to each model.

Optimal design of automated market makers for decentralized exchanges.

problem Maximizing utility for liquidity providers in decentralized exchanges.
method Modeling a risk-averse liquidity provider's optimal strategy and the optimal design of automated market makers.
result The optimal unit trading fee increases with asset volatility.

Auto-Surprise automates recommender system selection and optimization.

problem Finding the best algorithm and hyperparameters for recommender systems.
method Extends Surprise library with TPE optimization for algorithm selection and hyperparameter tuning.
result Significantly faster in finding optimal hyperparameters compared to grid search.

Optimizes classifiers for varying levels of automation.

problem Supervised learning models often perform worse than human experts on specific instances.
method Focuses on convex margin-based classifiers, showing the problem is NP-hard. For SVMs, the objective function is decomposed into monotone and modular components, allowing efficient algorithms to solve the problem.
result The approach demonstrates that classifiers optimized for varying levels of automation can outperform full automation and human-only models.

Optimizes liquidity provision intervals for profitable AMM participation.

problem Financial losses from poor liquidity provision intervals and reallocation costs.
method Developed a tractable stochastic optimization problem.
result Computes optimal liquidity provision intervals for profitable liquidity concentration.

Optimal dynamic fees found for AMMs to deter arbitrageurs and attract noise traders.

problem Optimizing fees in AMMs to balance against arbitrage and noise trading.
method Approximate closed-form solutions to control problem, study of fee structure.
result Two distinct fee regimes identified: high fees to deter arbitrage, low fees to attract noise traders.

We propose a novel method that makes use of deep neural networks and gradient decent to perform automated design on complex real world engineering tasks. Our approach works by training a neural network to mimic the fitness function of a design optimization task and then, using the differential nature of the neural netw…

2017-10-27abs ↗pdf ↗

This paper presents preliminary work on learning the search heuristic for the optimal motion planning for automated driving in urban traffic. Previous work considered search-based optimal motion planning framework (SBOMP) that utilized numerical or model-based heuristics that did not consider dynamic obstacles. Optimal…

2018-05-25abs ↗pdf ↗

With the advent of automated machine learning, automated hyperparameter optimization methods are by now routinely used in data mining. However, this progress is not yet matched by equal progress on automatic analyses that yield information beyond performance-optimizing hyperparameter settings. In this work, we aim to a…

2017-10-12abs ↗pdf ↗

The growing interest in both the automation of machine learning and deep learning has inevitably led to the development of a wide variety of automated methods for neural architecture search. The choice of the network architecture has proven to be critical, and many advances in deep learning spring from its immediate im…

2019-05-04abs ↗pdf ↗

This paper optimizes liquidity provision in automated market makers using auction theory.

problem Optimizing profit for a monopolist liquidity provider in automated market makers.
method Introduces a Bayesian-like belief inference framework to model AMMs, characterizes profit-maximizing strategies using Myerson's optimal auction theory.
result Characterizes the optimal demand curve and payments for an IC AMM, revealing a bid-ask spread caused by asymmetry and monopoly pricing.

Automates RL with sample-efficient hyperparameter optimization.

problem Challenges in applying deep RL due to hyperparameter sensitivity and inefficiency.
method Population-based AutoRL framework for meta-optimizing RL algorithms and architectures.
result Reduces the number of environment interactions needed for meta-optimization by up to an order of magnitude.

Automated trading systems on developed and emerging capital markets are studied in this paper. The standard for developed market is automated trading system with 40-days simple moving average. We tested it for the index SIX Industrial for 1000 and 730 trading days of the slovak emerging capital market. The Buy and Hold…

2005-05-04abs ↗pdf ↗

BOOST automates kernel and acquisition function selection in Bayesian optimization.

problem Inappropriate kernel and acquisition function combinations lead to poor performance in Bayesian optimization.
method BOOST uses offline evaluation to predict and select the best kernel-acquisition function pair.
result BOOST consistently improves over fixed-hyperparameter BO and is competitive with state-of-the-art adaptive methods.

Automated machine learning aims to automate the whole process of machine learning, including model configuration. In this paper, we focus on automated hyperparameter optimization (HPO) based on sequential model-based optimization (SMBO). Though conventional SMBO algorithms work well when abundant HPO trials are availab…

2019-09-07abs ↗pdf ↗

AutoPQ automates quantile forecasting for smart grids, reducing workload and environmental impact.

problem Accurate and unbiased uncertainty quantification in probabilistic forecasting for smart grid operations.
method AutoPQ uses a conditional Invertible Neural Network (cINN) to generate quantile forecasts from point forecasts, automating model selection and hyperparameter optimization.
result AutoPQ outperforms state-of-the-art methods while reducing computational effort and environmental impact.

Improves reliability of BBVI optimization methods.

problem Reliability issues and expertise required for BBVI optimization.
method RABVI framework with automated learning rate adjustment and KL divergence estimation.
result RABVI detects inaccurate variational approximations and optimizes reliability.

This paper analyzes and compares different Automated Market Maker mechanisms.

problem Impermanent loss in Constant Function Market Makers.
method Mean-Variance analysis of liquidity providers' profit and loss, comparison of different mechanisms.
result Optimized oracle-based mechanisms outperform Constant Function Market Makers.

Study examines how uncertainty visualization affects analyst trust in automated classification systems.

problem The impact of uncertainty on analyst trust in automated classification systems.
method Empirical study evaluating different active learning query policies and visualizations.
result Query policy significantly influences analyst trust in automated classification systems.

Classical stochastic gradient methods for optimization rely on noisy gradient approximations that become progressively less accurate as iterates approach a solution. The large noise and small signal in the resulting gradients makes it difficult to use them for adaptive stepsize selection and automatic stopping. We prop…

2016-10-18abs ↗pdf ↗

Optimizes liquidity withdrawal timing for AMM LPs to balance fees and impermanent loss.

problem Balancing fees and impermanent loss in automated market makers.
method Stochastic control problem with endogenous stopping time, numerical solutions via Euler scheme and Longstaff-Schwartz method.
result Optimal exit strategy depends on volatility, fees, and market dynamics.

Mango automates hyperparameter tuning for large-scale ML training.

problem Manual hyperparameter tuning is tedious and inefficient for large-scale machine learning.
method Parallel hyperparameter tuning with intelligent search strategies and flexible abstractions.
result Mango achieves comparable performance to Hyperopt while supporting distributed computing.

SOCRATES uses LLMs to automate simulation optimization of complex systems.

problem Optimizing complex, expensive-to-sample stochastic systems.
method Two-stage procedure: replica construction and meta-optimization.
result Adaptive hybrid optimization schedule for real systems.

This study optimizes trading and arbitrage in decentralized finance's CPMs, revealing convexity costs and developing efficient strategies.

problem Optimizing trading and arbitrage in decentralized finance's constant product markets (CPMs).
method Developed models for CPMs in competing centralised exchanges, CPMs, and both venues. Derived computationally efficient strategies.
result Accurately estimated convexity costs in CPMs, which are linear in trade size and nonlinear in liquidity depth and exchange rate.