Tick-by-tick liquidity provision aims to maximize fees and reserves.
problem Maximizing fees and reserves in concentrated liquidity.
method Convex optimization for tick-level liquidity provision.
result Concentrating liquidity around current price is not always best.
Proposes a deep RL approach for high-frequency market making using tick data and periodic signals.
problem Challenges in high-frequency market making due to tick-level data complexity and high trading volume.
method Integrates tick-level data with periodic signals using deep reinforcement learning.
result The proposed framework outperforms existing methods in profitability and risk management.
A novel framework extracts essential factors from order flow data for high-frequency trading.
problem Challenges in extracting and utilizing order flow data due to its large volume and limitations of traditional techniques.
method Proposes a Context Encoder and Factor Extractor for unsupervised learning of important signals from order flow data.
result Extracts superior factors from order flow data, improving stock trend prediction and order execution tasks.
Study applies Hawkes volatility to mid-price process for real-time risk management.
problem Lack of studies on Hawkes volatility for tick-level price dynamics.
method Derived variance formula for unmarked and marked Hawkes models, applied to mid-price process.
result Reliable results and high predictive power of intraday Hawkes volatility.
Study of Polymarket's prediction market microstructure using tick-level order book data.
problem Understanding the microstructure of decentralized prediction markets.
method Analysis of a continuous tick-level order book feed and on-chain trade records.
result Trade direction inferred from Polymarket's public order-book feed disagrees with on-chain data in ~59% of cases.
Bitcoin option prices reflect both market maker supply and trader demand, especially from those with insider information.
problem Understanding how market prices of bitcoin options are influenced by both market makers and informed traders.
method Analysis of Deribit options tick-level data to identify supply and demand effects.
result At-the-money option prices are driven by volatility traders, while out-of-the-money options are influenced by both volatility traders and those with insider information.
The cryptocurrency market is amongst the fastest-growing of all the financial markets in the world. Unlike traditional markets, such as equities, foreign exchange and commodities, cryptocurrency market is considered to have larger volatility and illiquidity. This paper is inspired by the recent success of using deep le…
VOLARE provides standardized realized volatility measures from financial data.
problem Lack of standardized realized volatility measures from ultra-high-frequency data.
method Asset-specific pipeline for cleaning and sampling data, providing a wide range of realized estimators.
result Comprehensive set of realized estimators for equities, exchange rates, and futures.
We have analyzed the statistical probabilities of limit-order book (LOB) shape through building the book using the ultra-high-frequency data from 23 liquid stocks traded on the Shenzhen Stock Exchange in 2003. We find that the averaged LOB shape has a maximum away from the same best price for both buy and sell LOBs. Th…
We introduce a new stochastic model for the variations of asset prices at the tick-by-tick level in dimension 1 (for a single asset) and 2 (for a pair of assets). The construction is based on marked point processes and relies on linear self and mutually exciting stochastic intensities as introduced by Hawkes. We associ…
Neural HMM with AGA captures multi-scale dynamics in financial markets.
problem Capturing multi-scale temporal dynamics in financial markets.
method Parallel multi-resolution encoders, adaptive gating, and multi-head attention.
result Outperforms fixed-resolution baselines in predicting price movements and liquidity shocks.
DeepScalper uses RL to capture intraday trading opportunities, balancing risk and profit.
problem Capturing fleeting intraday trading opportunities in high-frequency markets.
method Dueling Q-network, reward function with hindsight bonus, encoder-decoder architecture, risk-aware auxiliary task.
result Significantly outperforms state-of-the-art baselines in financial criteria.
Study identifies key metrics for small and large tick assets in LOBs.
problem Understanding microstructural properties of LOBs across different tick sizes.
method Hawkes Process model to fit LOBs of large and small tick assets.
result Model can transition stylized facts from large to small tick assets.
This paper formalizes Uniswap v3 using PTA and FST for rigorous analysis.
problem Formal modeling of Uniswap v3's concentrated liquidity for rigorous analysis.
method Formal state machine models using PTA and FST, proving rounding bounds.
result Formal justification of Uniswap v3's ε-slack and rounding safety. Bayesian optimization reduces computational effort in aircraft design optimization.
problem High computational cost in industrial aircraft design optimization.
method Constrained Bayesian optimization (Super Efficient Global Optimization with Mixture of Experts)
result Significant computational efficiency improvements over existing Isight optimizers.
Bayesian optimization method tackles combinatorial spaces, scalable for large data.
problem Optimization over combinatorial categorical spaces in natural sciences.
method Combines variational optimization and continuous relaxations for gradient-based optimization.
result Method performs comparably to state-of-the-art methods while scaling well.
New algorithm solves complex stopping problems with robust optimization.
problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.
L2O uses ML to optimize traditional optimization techniques.
problem Real-world optimization problems with shared structures.
method Exploiting shared structures to enhance optimization techniques.
result Better or faster solutions through machine learning integration.
When hyperparameter optimization of a machine learning algorithm is repeated for multiple datasets it is possible to transfer knowledge to an optimization run on a new dataset. We develop a new hyperparameter-free ensemble model for Bayesian optimization that is a generalization of two existing transfer learning extens…
Meta algorithm solves multivariate optimization using univariate optimizers.
problem Multivariate global optimization problems.
method Meta algorithm combining univariate global optimizers.
result Meta algorithm provides robust regret guarantees.
A novel neural network approach for optimization problems.
problem Constrained optimization problems.
method Neural Optimization Machine (NOM) using a specially designed NN architecture and training procedure.
result Solves optimization problems efficiently, especially in high-dimensional spaces.
New algorithms ensure reproducibility and optimal convergence in convex optimization.
problem Trade-off between reproducibility and convergence rate in convex optimization.
method Regularization-based algorithms for smooth convex minimization and minimax optimization.
result Achieves optimal reproducibility and near-optimal gradient complexity for various oracle settings.
New algorithm selects robust martingale for optimal stopping problems.
problem Optimal stopping problems in stochastic processes.
method Randomized dual martingale minimization algorithm.
result Efficiently selects Doob martingale as close as possible.
Numerical optimization is an important tool in the field of computational physics in general and in nano-optics in specific. It has attracted attention with the increase in complexity of structures that can be realized with nowadays nano-fabrication technologies for which a rational design is no longer feasible. Also, …
This paper shows how to combine optimal tests into log-optimal processes.
problem How to combine optimal sequential tests into log-optimal processes.
method Using a new class of WAIT e-processes, the paper aggregates asymptotically optimal sequential tests into asymptotically log-optimal processes.
result It is possible to aggregate asymptotically optimal sequential tests into asymptotically log-optimal e-processes.
Learning optimal feedback control laws capable of executing optimal trajectories is essential for many robotic applications. Such policies can be learned using reinforcement learning or planned using optimal control. While reinforcement learning is sample inefficient, optimal control only plans an optimal trajectory fr…
Paper studies optimal control for a specific geometric problem.
problem Optimal control problem associated with the Paneitz obstacle problem.
method Existence and regularity results for optimal controls.
result Existence of optimal controls and their properties.
New algorithm AG-OG optimizes separable convex-concave problems efficiently.
problem Efficiently solving separable convex-concave minimax optimization problems.
method Leverages Nesterov acceleration and optimistic gradient on component and coupling parts of the problem.
result Achieves optimal convergence rate for various settings including bilinearly coupled problems.
Adapts Bayesian optimization for mixed constraints in aircraft design.
problem Optimizing expensive black box functions with mixed constraints.
method Super efficient global optimization with upper trust bound for constraints, Gaussian process uncertainty, refinement procedure.
result Superior performance on aircraft design problem compared to state-of-the-art solvers.
Adam optimizer converges to zeros of a new vector field, not just gradient zeros.
problem Prove convergence rates for Adam optimizer in simple quadratic optimization problems.
method Introduced Adam vector field to analyze Adam optimizer's convergence.
result Established optimal convergence rates for Adam optimizer.
Optimal crypto asset routing with CFMMs, including fixed costs.
problem Optimizing order execution on a network of CFMMs with fixed costs.
method Convex optimization for no fixed costs, mixed-integer convex for fixed costs, heuristics for approximate solutions.
result Approximate solutions to optimal routing and arbitrage certification problems.
BOSH optimizes functions with stochastic evaluations more efficiently and precisely.
problem Optimizing functions with noisy evaluations can lead to suboptimal solutions.
method BOSH uses a hierarchical Gaussian process to generate a growing pool of realizations.
result BOSH provides more efficient and higher-precision optimization than standard BO.
VeLO learns versatile optimizers from deep learning tasks.
problem Training deep learning models with hand-designed optimizers.
method Meta-training a neural network optimizer on a wide variety of optimization tasks.
result The learned optimizer automatically adapts to different optimization tasks without hyperparameter tuning.
New learned optimizers outperform baselines by incorporating known and novel mechanisms.
problem Understanding how learned optimizers outperform traditional ones.
method Careful analysis and visualization of learned optimizers trained on various tasks.
result Learned optimizers incorporate known techniques like momentum and gradient clipping, as well as new forms of learning rate adaptation.
PAGE optimizes nonconvex problems with optimal convergence rates.
problem Nonconvex optimization problems.
method PAGE algorithm for achieving optimal convergence rates.
result PAGE achieves optimal convergence rates for nonconvex optimization.
A new method learns DAGs from data using permutation optimization.
problem Discovering latent DAGs from observational data.
method Optimizes over the Permutahedron to learn topological orderings and edges.
result Our method optimizes exact DAGs, is modular, and performs well on real-world data.
Develops a new method for efficient stochastic bilevel optimization.
problem Stochastic bilevel optimization problems in machine learning applications.
method Single-Timescale stochAstic BiLevEl optimization (STABLE) method.
result Achieves the same order of sample complexity as stochastic gradient descent for single-level optimization.
Enhanced ROOT-SGD optimizes stochastic optimization with diminishing stepsizes.
problem Improving statistical efficiency in stochastic optimization.
method Integrates a diminishing stepsize strategy into ROOT-SGD.
result Achieves optimal convergence rates with improved stability and precision.
Convex optimization models predict outputs from inputs via optimization problems.
problem Predicting outputs from inputs using convex optimization models.
method Proposed a heuristic for learning parameters of convex optimization models from datasets.
result Demonstrated the effectiveness of the proposed method on three model classes.
A new approach for efficient batch multiobjective optimization using Thompson sampling.
problem Inefficient batch multiobjective optimization due to expensive oracles and hard inner optimization.
method Proposes a Thompson sampling approach (qextttPOTS) that chooses Pareto optimal candidates sequentially. result Empirically superior performance compared to classical evolutionary approaches and MOBO.
New framework for decentralized optimization of upper-linearizable functions with improved regret and complexity.
problem Decentralized optimization of upper-linearizable functions with general constraints.
method Decentralized projection-free optimization with upper-linearizable function framework.
result Regret of O(T1−θ/2) with communication complexity of O(Tθ) and linear optimization calls of O(T2θ). New method optimizes portfolio weights as functions, outperforming traditional approaches.
problem Optimizing portfolio weights in mean-variance models.
method Functional optimization approach, treating weights as functions of past values.
result Gradient-ascent algorithms can solve functional optimization problems for mean-variance portfolio management.
Improved stability and generalization for blackbox learned optimizers.
problem Stability and generalization issues in blackbox learned optimizers.
method Investigation using dynamical systems, modifications to optimizer architecture and meta-training procedure.
result Improved stability and generalization of learned optimizers.
PSO improves G-optimal designs for up to 5 factors, reducing computation time.
problem Computing highly G-optimal designs for response surface models is computationally expensive. method Extended Particle Swarm Optimization (PSO) for optimal design problems.
result PSO generates improved G-optimal designs for up to 5 factors with comparable computational cost. We develop the first Bayesian Optimization algorithm, BLOSSOM, which selects between multiple alternative acquisition functions and traditional local optimization at each step. This is combined with a novel stopping condition based on expected regret. This pairing allows us to obtain the best characteristics of both lo…
This work analyzes and optimizes memory and compute costs of learned optimizers.
problem High memory and compute costs of learned optimizers.
method Identified and quantified design features of learned and hand-designed optimizers, constructed a more efficient learned optimizer.
result A learned optimizer that is faster and more memory efficient than previous work.
Bayesian optimization outperformed random search in machine learning hyperparameter tuning challenge.
problem Optimizing hyperparameters of machine learning models using derivative-free methods.
method Bayesian optimization vs. random search on real datasets.
result Bayesian optimization significantly outperformed random search in held-out objective functions.
Optimizes shapes on non-standard manifolds.
problem Optimization on non-standard infinite-dimensional manifolds.
method Develops gradient descent on weak Riemannian manifolds.
result Establishes foundational properties for optimization on various weak Riemannian manifolds.