Optimizes trading strategy considering alpha decay and transaction costs.
problem Maximizing reward in a multi-period portfolio with transaction costs and alpha decay.
method Formulated as an infinite horizon Markov Decision Process, solved using a modified value iteration algorithm with convergence proof and asymptotic analysis.
result Characterized optimal trading policy that maximizes average expected reward.
Paper examines costs of using wrong price impact models in trading.
problem Misspecifying price impact models in trading predictions.
method Derives formulas for misspecification costs and applies to trading data.
result Misspecification costs are asymmetric, affecting profits and losses.
New algorithm improves cache management with delayed feedback and decaying costs.
problem Improving cache replacement policies with delayed and decaying costs feedback.
method Proposed EXP4-DFDC adaptive reinforcement learning algorithm.
result Expected regret is a vanishing quantity as a function of time.
The paper connects neural collapse and low-rank bias in networks with L2 regularization.
problem Understanding the emergence of low-rank bias and neural collapse in L2-regularized networks.
method Unified theoretical framework linking TCV and rank of weight matrices, proving global optimality of DNC1, and establishing a benign landscape property.
result Zero TCV across intermediate layers minimizes representation cost under natural architectural constraints, and DNC1 is globally optimal.
In this paper, we reveal the attenuation mechanism of anchor of the commodity money from the perspective of logistics warehousing costs, and propose a novel Decayed Commodity Money (DCM) for the store of value across time and space. Considering the logistics cost of commodity warehousing by the third financial institut…
This article provides a novel framework to evaluate limit order tactics that highlights expected fill price, adverse price selection cost, and opportunity cost. We formulate the problem of optimal execution of market orders with nonlinear market impact, power law decay kernel, and stochastic and deterministic liquidity…
We describe a Markov latent state space (MLSS) model, where the latent state distribution is a decaying mixture over multiple past states. We present a simple sampling algorithm that allows to approximate such high-order MLSS with fixed time and memory costs.
Two new algorithms reduce online kernel regression's computational cost while maintaining optimal regret bounds.
problem Trade-off between regret and computational cost in online kernel regression.
method AOGD-ALD and NONS-ALD algorithms dynamically maintain nearly orthogonal basis to approximate kernel mapping and control approximate error.
result Achieves nearly optimal regret bounds at sublinear computational complexity.
Performance-critical machine learning models should be robust to input perturbations not seen during training. Adversarial training is a method for improving a model's robustness to some perturbations by including them in the training process, but this tends to exacerbate other vulnerabilities of the model. The adversa…
New method for training deep neural networks with regularization, converging to better generalization.
problem Improving generalization of deep neural networks through explicit regularization.
method Regularizer Mirror Descent (RMD) method, inspired by convergence properties of stochastic mirror descent (SMD).
result RMD converges to a point close to the minimizer of the cost function, leading to better generalization performance.
Suppose k centers are fit to m points by heuristically minimizing the k-means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with p≥4 bounded moments; in particular, the difference between the sample cost and distribution cost decays with $…
Adaptive weights improve physics-informed neural networks and deep operator networks.
problem Training physics-informed neural networks and deep operator networks can be challenging, leading to unsatisfactory accuracy and efficiency.
method Proposes a pointwise adaptive weighting method that balances the residual decay rate across different training points.
result Our proposed approach of balanced residual decay rates offers advantages including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.
Neural processes approximate Gaussian process inference, revealing three key costs.
problem Approximating Gaussian process inference with neural processes.
method Bounding KL divergence into three components: label contamination, information bottleneck, and amortization error.
result Characterization of three costs of amortizing Gaussian process inference with neural processes.
We study the high-frequency limits of strategies and costs in a Nash equilibrium for two agents that are competing to minimize liquidation costs in a discrete-time market impact model with exponentially decaying price impact and quadratic transaction costs of size θ≥0. We show that, for θ=0, equilibrium strategie…
One-shot algorithm for feature-distributed kernel PCA reduces communication costs.
problem Efficiently perform kernel PCA in distributed computing environments.
method Inspired by dual relationship between sample-distributed and feature-distributed scenarios, proposes a one-shot algorithm for feature-distributed kernel PCA.
result The algorithm provides high-quality results with low communication costs, especially when eigenvalues decay fast.
Trading algorithms that execute large orders are susceptible to exploitation by order anticipation strategies. This paper studies the influence of order anticipation strategies in a multi-investor model of optimal execution under transient price impact. Existence and uniqueness of a Nash equilibrium is established unde…
In this paper, we consider the problem of recovering a graph that represents the statistical data dependency among nodes for a set of data samples generated by nodes, which provides the basic structure to perform an inference task, such as MAP (maximum a posteriori). This problem is referred to as structure learning. W…
New method SF-AdamW trains large models without decay phases or memory overhead.
problem Inadequate fixed compute budgets for large-scale training.
method Schedule-Free (SF) method revisited and refined.
result SF-AdamW effectively navigates loss landscape without decay phases or memory overhead.
Quantized Variational Inference improves ELBO optimization with fast convergence.
problem Maximizing Evidence Lower Bound (ELBO) for variational inference.
method Optimal Voronoi Tesselation for variance-free gradients, Richardson extrapolation for asymptotic improvement.
result Quantized Variational Inference leads to fast convergence with comparable computational cost.
Estimate arrival times in random recursive trees using iterated Jordan centralities.
problem Estimate arrival times in random recursive trees.
method Pointwise approach using iterated Jordan centralities.
result Tail bounds for relative estimation error.
Our study proposes a new currency system to protect wealth from over-issued fiat and stablecoins.
problem The over-issuance of fiat and stablecoins undermines the stability of currency purchasing power.
method We introduce a parallel monetary system based on redeemable self-decaying money (RSDM) to provide a stable currency alternative.
result A parallel monetary system including RSDM, domestic fiat, and major reserve currencies can safeguard wealth and prevent the reverse Gresham law.
Study shows randomized strategies can't be Nash equilibria in markets with transient price impact.
problem Existence of pure Nash equilibria in markets with transient price impact.
method Considered randomized strategies and showed that they cannot be Nash equilibria.
result Nash equilibria cannot contain randomized strategies.
We develop a novel approximate simulation algorithm for the joint law of the position, the running supremum and the time of the supremum of a general Lévy process at an arbitrary finite time. We identify the law of the error in simple terms. We prove that the error decays geometrically in Lp (for any p≥1) as a…
Optimal trading is a recent field of research which was initiated by Almgren, Chriss, Bertsimas and Lo in the late 90's. Its main application is slicing large trading orders, in the interest of minimizing trading costs and potential perturbations of price dynamics due to liquidity shocks. The initial optimization frame…
Simulates realistic execution and costs in limit order books.
problem Realistic simulation of limit order books for large-tick assets.
method Tractable representation of spread and volume imbalance; calibrated event timing; feedback mechanism for market impact.
result Simulator yields realistic behavior and sensitivity to execution parameters.
Anomaly Awareness detects anomalies in particle physics and computer vision.
problem Detect anomalies in complex data sets.
method Modifies cost function to learn normal events and anomalies.
result Effective at identifying new anomalies not previously seen.
Pruning filters in neural networks improves performance and reduces costs.
problem Large neural networks have high inference costs and limited resource usage.
method Batch Bridgeout for efficient pruning of convolutional filters.
result Batch Bridgeout trained networks achieve higher accuracy across various pruning intensities.
Extends Minkowski stability proof to minimal decay assumptions.
problem Global stability of Minkowski spacetime with minimal decay.
method Extends Christodoulou-Klainerman's proof to minimal decay assumptions.
result Exterior stability of Minkowski holds with borderline decay.
T-KAN improves HFT LOB forecasting with learnable splines.
problem Alpha decay in HFT LOB forecasting models.
method T-KAN uses learnable B-spline activation functions to model market signals.
result 19.1% relative improvement in F1-score at k = 100 horizon.
New method creates vacuum data at minimal and borderline decay thresholds.
problem Creating vacuum initial data at specific decay thresholds.
method Conical solution-operator method applied to vacuum asymptotically flat initial data.
result Demonstrates global and exterior stability of Minkowski spacetime.
Unique solutions found for wave-like decaying null infinity equations.
problem Wave-like decaying null infinity equations with spherically symmetric Einstein-scalar-field.
method Local and global unique solutions for small initial data.
result Sharp decaying condition for unique solutions.
In several recently proposed stochastic optimization methods (e.g. RMSProp, Adam, Adadelta), parameter updates are scaled by the inverse square roots of exponential moving averages of squared past gradients. Maintaining these per-parameter second-moment estimators requires memory equal to the number of parameters. For …
In this paper, we propose a communication- and computation-efficient algorithm to solve a convex consensus optimization problem defined over a decentralized network. A remarkable existing algorithm to solve this problem is the alternating direction method of multipliers (ADMM), in which at every iteration every node up…
New findings on flatness of certain metrics with fast decay.
problem Rigidity of positive mass theorem under fast metric decay.
method Considered metrics with nonnegative scalar curvature and rapid decay at infinity.
result Any such metric is necessarily flat in dimensions 4 and higher if decay rate exceeds Schwarzschild metric.
Stochastic momentum methods trade compute efficiency for serial runtime.
problem Stochastic momentum methods trade compute efficiency for serial runtime.
method Stochastic HB and ASGD for consistent linear regression with Gaussian covariates.
result HB preserves SGD-level CE over a larger batch-size window, allowing larger batches to reduce serial runtime until HB reaches its deterministic accelerated scale.
Study on curvature decay in steady Ricci solitons, proving dichotomy.
problem Curvature decay in steady Ricci solitons.
method Established a dichotomy for curvature decay in specific types of solitons.
result Proved a dichotomy on curvature decay for certain steady Ricci solitons.
Cautious Weight Decay modifies weight decay for better optimization.
problem Improving optimization in deep learning models.
method Applies weight decay selectively based on parameter sign alignment.
result Consistently improves model performance across various tasks and scales.
Study on scalar curvature decay on non-compact manifolds linked at infinity.
problem Understanding scalar curvature decay on non-compact manifolds with topological linking at infinity.
method Analyzing polynomial decay, developing obstruction theory, using μ--bubble exhaustions, and index theory. result Topological linking at infinity forces polynomial decay of scalar curvature on manifolds of weakly bounded geometry.
Paper estimates EOT maps for non-compactly supported measures with subGaussian target.
problem Estimating EOT maps between non-compactly supported measures.
method Uses bias-variance decomposition, T1-transport inequalities, and concentration of measure results.
result Shows error decay rates for different cases of subGaussian measures.
Study on massless Vlasov equation on Reissner-Nordström spacetimes, showing decay rates and non-decay phenomena.
problem Analyzing decay and non-decay rates of solutions to the massless Vlasov equation on Reissner-Nordström spacetimes.
method Quantitative analysis of geodesic flow and comparison to wave equation instability results.
result Exponential decay rates in subextremal cases and polynomial rates in extremal cases, with non-decay of transversal derivatives in extremal cases.
Introduces gradient decay in Softmax for better generalization.
problem Improving generalization performance in neural networks.
method Gradient decay hyperparameter in Softmax for varying gradient rates based on probability.
result Gradient decay rate affects generalization performance and can be tuned for better optimization.
As the decade turns, we reflect on nearly thirty years of successful manipulation of the world's public equity markets. This reflection highlights a few of the key enabling ingredients and lessons learned along the way. A quantitative understanding of market impact and its decay, which we cover briefly, lets you move l…
Study examines wave equation decay and Strichartz estimates on conic manifolds.
problem Analyzing wave equation behavior on conic spaces with critical electromagnetic potentials.
method Established decay and Strichartz estimates through localized spectral measure construction.
result Extended and improved previous results on wave equation behavior with critical potentials.
Study shows uniform decay rate for singular mean curvature flows.
problem Understanding singularities in mean curvature flows.
method Rescaled flow analysis near compact singularities.
result Uniform decay order bound for the rescaled flow.
Weight decay stabilizes training dynamics by slowing progressive sharpening.
problem Understanding how weight decay affects training stability in deep learning models.
method Analyzing weight decay effects at the Edge of Stability, developing a mathematical framework.
result Weight decay dampens oscillations and stabilizes sharpness in CNNs, causing a phase transition in MLPs.
Polynomial decay of correlations shown for curved surfaces.
problem Analyzing geodesic flows on curved surfaces.
method Proving polynomial decay of correlations for geodesic flows on nonpositively curved surfaces.
result Polynomial decay of correlations for geodesic flows on nonpositively curved surfaces.
Last SGD iterate bounds for overparameterized linear regression.
problem Analyzing the last iterate risk bounds of SGD with decaying stepsize for overparameterized linear regression.
method Problem-dependent analysis of last iterate risk bounds of SGD with geometrically decaying stepsize.
result Proved nearly matching upper and lower bounds on the excess risk for last iterate SGD with geometrically decaying stepsize.
Optimal learning rates decay to zero in easy tasks and maintain a warmup phase in hard tasks.
problem Optimizing learning rates under functional scaling laws for model training.
method Deriving optimal learning-rate schedules based on exponents s and β. result Sharp phase transition between easy and hard tasks, with different decay behaviors.