Study shows how wealth distribution leads to volatility clustering in speculative markets.
problem Volatility clustering in financial markets.
method Agent-based model of financial markets with heterogeneous wealth distribution and round-trip trading.
result Heterogeneous wealth distribution induces volatility clustering through market wealth redistribution.
The paper applies thermodynamics to financial markets to prove no-arbitrage constraints.
problem No arbitrage in financial markets under price impact.
method Stochastic thermodynamics applied to financial trading cycles.
result Proves any round-trip trading strategy yields non-positive expected profit.
Study infers daily work and study trips from census data.
problem Estimate weekly regular displacements for better urban planning.
method Multi-task learning neural network model.
result Significant error rate reduction in multi-task learning.
Optimal trade execution in a fluctuating market with stochastic liquidity.
problem Minimizing costs in a market with unpredictable liquidity.
method Developed a recursion to find the least costly trade execution strategy.
result Explicit recursion characterizes the least costly trade execution.
We provide some theoretical extensions and a calibration protocol for our former dynamic optimal execution model. The Hawkes parameters and the propagator are estimated independently on financial data from stocks of the CAC40. Interestingly, the propagator exhibits a smoothly decaying form with one or two dominant time…
We extend the framework of trading strategies of Gatheral [2010] from single stocks to a pair of stocks. Our trading strategy with the executions of two round-trip trades can be described by the trading rates of the paired stocks and the ratio of their trading periods. By minimizing the potential cost arising from cros…
Agent optimizes risky asset trading times based on Prospect Theory.
problem Optimizing speculative trading times with transaction costs.
method Formulated as a sequential optimal stopping problem, characterized the solution.
result Trading patterns influenced by preference and market friction.
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.
Quant firms manipulate stock markets overnight and intraday.
problem Unexplained consistent overnight and intraday returns in stock markets.
method Analysis of trading patterns and market movements.
result Large quant firms expand and contract portfolios to create mark-to-market gains.
Technical trading rules and linear regressive models are often used by practitioners to find trends in financial data. However, these models are unsuited to find non-linearly separable patterns. We propose a decision tree forecasting model that has the flexibility to capture arbitrary patterns. To illustrate, we constr…
The paper optimizes cheap and novel flight itineraries using machine learning.
problem Constructing cheap and novel round trip flight itineraries efficiently.
method Formulated as a trade-off between recall and costs, used supervised learning with location embeddings.
result Achieved AUC=80.48, a significant improvement over simpler methods.
Two methods generate parallel data for GEC, improving neural models' performance.
problem Lack of parallel data for GEC.
method Two approaches to generate large parallel datasets from Wikipedia data.
result Neural GEC models trained on generated corpora perform similarly and surpass state-of-the-art.
Optimal trading strategy under market resistance and concave price impact model.
problem Optimal trading in a market with endogenous resistance and concave price impact.
method Modeling market resistance, deriving a stochastic Fredholm equation, proving existence and uniqueness, proposing an iterative scheme.
result Existence and uniqueness of optimal control under certain conditions, exponential convergence of iterative scheme.
Study on liquidation games with market drop-out, proving unique equilibria.
problem Analyzing portfolio liquidation with market drop-out constraints.
method Proves existence and uniqueness of equilibria using integral equations.
result Existence and uniqueness of equilibria in both mean-field and finite-player games.
New model predicts chemical reactions without human input.
problem Automating retrosynthetic planning in chemistry.
method Combined Molecular Transformer and hyper-graph exploration.
result Improved accuracy in predicting reactants, reagents, solvents, and catalysts.
New HDP-HMM model accurately segments Internet path delays.
problem Automating the statistical analysis of large-scale network delay measurements.
method Infinite Hidden Markov Model (HDP-HMM) for trace segmentation.
result The HDP-HMM model performs as well as human cognition in pattern recognition.
Study finds no statistically significant trading edge in MNQ futures signals from OHLCV data.
problem Testing intraday momentum signals from OHLCV data in MNQ futures under realistic execution constraints.
method 947 trading days of five-minute data, 14 signal families evaluated, strict institutional criteria applied.
result No signal satisfies all criteria simultaneously, gross edge insufficient to overcome costs.
Optimal trading strategy using LQR framework with price mean-reversion.
problem Developing a dynamic trading strategy in a market with linear and quadratic costs.
method Model Predictive Control (MPC) approach to optimize trading curve with positivity constraints.
result Optimal trading curve reacts opportunistically to price changes while satisfying constraints.
Comprisk simplifies competing-risks analysis in Python.
problem Analyzing medical time-to-event data with competing risks.
method A scikit-learn-compatible toolkit for competing-risks survival analysis.
result Comprisk provides a unified API for various competing-risks methods.
KineticSim accelerates financial market simulations 3406x over CPU.
problem Simulating financial markets at scale with multi-agent models is bottlenecked by sequential processing and GPU kernel overhead.
method Formalized and implemented a reusable parallel design pattern for iterative multi-agent reductions in thread-block shared memory.
result Achieved a peak throughput of over 54.7 billion agent-events per second, delivering 3406x speedup over CPU.
KineticSim: A lightweight, high-performance execution engine for real-time market simulators
problem Simulating financial markets at scale with multi-agent models
method Reusable parallel design pattern: persistent, state-carrying clearing for iterative multi-agent reductions
result Reduces per-step critical-path depth from Theta(L+A) to Theta(log L + ceil(A/L))
This thesis tackles non-convex Bayesian learning via scalable dynamic importance sampling algorithms.
problem Non-convex Bayesian learning problem in deep neural networks.
method Replica exchange Langevin Monte Carlo, control variates method, population-chain replica exchange, scalable dynamic importance sampling.
result Control variates method reduces variance and accelerates convergence in non-convex Bayesian learning.
RLCache uses reinforcement learning to optimize cache management decisions.
problem Optimizing cache hit rate and storage size in computer systems.
method Designing three reinforcement learning agents for cache manager tasks and two advanced architectures.
result Reinforcement learning agents achieve higher cache hit rates and minimize storage space compared to heuristics.