Paper uses relaxation techniques to find optimal brokerage fees with private signals.
problem Finding optimal brokerage fees for clients with private trading signals.
method Relaxation techniques to establish contract existence in asymmetric information settings.
result Existence of optimal brokerage fees established in a market model with private signals.
Brokerage algorithm learns from context to minimize trading regret.
problem Minimizing trading regret in a sequential brokerage problem.
method Design of algorithms with optimal theoretical regret guarantees.
result Optimal theoretical regret guarantees under various assumptions.
This paper optimizes brokerage contracts for multiple clients trading a single asset.
problem Optimizing brokerage contracts for multiple clients trading a single asset.
method Endogenously determines clients' reservation values and strategically chooses clients. Characterizes optimal portfolios computationally.
result Characterizes optimal portfolios of clients and their profits, showing dependence on price impact coefficients.
A policy learns optimal truckload prices through reinforcement learning.
problem Optimizing prices for truckload brokers in dynamic markets.
method Knowledge gradient policy with bootstrap aggregation for high-dimensional settings.
result The policy maximizes the value of information in high-dimensional contextual settings.
The study explores when it's best to remove a real estate broker from the process.
problem Optimal conditions for removing a real estate broker.
method New models analyzing information asymmetry, social capital, and contract types.
result Dis-intermediation can be optimal under certain conditions.
Cryptocurrency traders increase stock risk-seeking behavior.
problem Understanding the motivations behind cryptocurrency trading.
method Individual-level brokerage data analysis of stock trading behavior.
result Cryptocurrency traders increase risk-seeking behavior in stocks when engaging in cryptocurrency trading.
Order flow in equity markets is remarkably persistent in the sense that order signs (to buy or sell) are positively autocorrelated out to time lags of tens of thousands of orders, corresponding to many days. Two possible explanations are herding, corresponding to positive correlation in the behavior of different invest…
Model predicts Chinese stock market liquidity and customer order behavior.
problem Understanding market liquidity and customer order behavior in the Chinese stock market.
method Dual state-space model using Fourier transform to connect volume-at-price buckets to correlations.
result Customer orders are correlated with market sentiment and stock returns, not with bond returns.
Study analyzes broker's gain from trade in repeated context-based trading.
problem Maximizing traders' net utility in repeated context-based brokerage.
method Proposes algorithms achieving tight regret bounds in full and limited feedback settings.
result Achieves tight 1/2-approximation result for gain from trade.
Maximizing trading volume in online learning framework between traders.
problem Maximizing the total number of trades between traders with unknown valuations.
method Developed algorithms for brokers to maximize trading volume under different feedback scenarios.
result Achieved logarithmic and poly-logarithmic regret rates for different feedback models.
In this paper we develop a new form of agent-based model for limit order books based on heterogeneous trading agents, whose motivations are liquidity driven. These agents are abstractions of real market participants, expressed in a stochastic model framework. We develop an efficient way to perform statistical calibrati…
Study shows how national culture influences investors' tendency to hold or sell stocks.
problem Investors' tendency to hold or sell stocks varies internationally.
method Examined brokerage data from 83 countries, analyzed cultural dimensions and age/gender.
result National culture, specifically long-term orientation and indulgence, influences the disposition effect.
Simple model finds high correlation in retail crypto returns.
problem Discerning correlation in retail cryptocurrency markets without factors.
method Used N*(N) statistic to compare models of daily returns.
result High average pairwise correlation (60%) found, supports isotropic model.
Rebellion Research's AI strategy outperformed the S&P 500 for 14 years.
problem Outperforming the S&P 500 for 14 years with AI.
method AI Global Equity strategy focused on machine learning.
result AI strategy has outperformed the S&P 500 for 14 years.
Study examines AI's role in robo-investing, focusing on benefits for specific investors.
problem Understanding the benefits of robo-investing for different investor types.
method Used a unique data set of brokerage accounts, analyzed various robo-investing strategies, compared human vs. machine performance.
result AI can provide benefits to low-income and high-risk-averse investors.
Two studies explain high margin loan rates by brokers.
problem High margin loan rates charged by stock brokers.
method Two approaches: finite revisions and monopolistic pricing.
result Small differences in revision frequency or monopoly pricing can explain loan rates.
Paper analyzes U.S. broker call rate laws of motion and their implications.
problem Understanding the dynamics and pricing of margin loans in the U.S. market.
method Analysis of monthly observations, derivation of stochastic differential equations, application of arbitrage theory.
result Margin loan interest rate follows mean-reverting behavior, with total call loan volume constituting over 70% of leveraged portfolios.
Method identifies causal interactions between time series using extreme eigenvalue variability.
problem Detecting causal interactions between time series.
method Largest eigenvalue of lagged correlation matrices, measuring causal interactions through variability.
result The method outperforms traditional Granger causality tests in detecting structural changes.
Trading strategy uses analyst coverage network to outperform markets.
problem Leveraging spillover effects between firms through analyst network.
method Graph attention network to aggregate firm and network signals.
result Annualized returns of 29.44% and Sharpe ratio of 4.06.
FinRobot AI agent for equity research provides comprehensive insights.
problem Narrow focus and limited discretion in AI solutions for equity research.
method Multi-agent Chain of Thought system integrating quantitative and qualitative analyses.
result FinRobot delivers insights comparable to major brokerage firms.
Crypto simulations show HODL strategy loads risk onto most investors, with macro-sentiment affecting returns.
problem Understanding real risk-return trade-offs and factors affecting crypto returns.
method Two independent analyses: 480 million Monte Carlo simulations and Bayesian multi-horizon local projection framework.
result HODL strategy exposes most investors to extreme downside risk, and macro-sentiment conditions are dominant indicators for future outcomes.
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.
New model reduces hyperparameter optimization time and improves transfer learning.
problem Hyperparameter optimization for machine learning across multiple datasets.
method Developed a new ensemble model for Bayesian optimization that transfers knowledge between datasets.
result Substantially reduces optimization time and improves over state-of-the-art transfer hyperparameter optimization.
Bayesian optimization outperforms other methods in nano-optical shape optimization and parameter reconstruction.
problem Optimizing nano-optical structures with non-convex objective functions.
method Benchmarked five global optimization methods including Bayesian optimization.
result Bayesian optimization yields significantly better results in a fraction of the time.
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.
BLOSSOM optimizes switching between local and Bayesian methods for faster convergence.
problem Optimizing function evaluations efficiently and converging to global minimum.
method Combines local and Bayesian optimization with a stopping condition based on expected regret.
result Achieves superior convergence and efficient use of function evaluations.
Survey of DRO, a robust optimization framework.
problem Risk-aversion and chance-constrained optimization challenges.
method Distributionally robust optimization (DRO) framework.
result DRO's growing importance in operations research and statistics.
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.
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.
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.
Proposes deep optimal feedback control for continuous-time systems with action constraints.
problem Learning optimal feedback control laws for robotic applications.
method Exploits Hamilton-Jacobi-Bellman equation and deep differential networks to learn optimal value function and feedback policy.
result Enables learning an optimal feedback control law that generates an optimal trajectory from any point in state-space without replanning.
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.
Optimizes stochastic and online optimization methods based on problem geometry.
problem Optimizing computational and statistical outcomes in stochastic and online optimization problems.
method Characterizes optimal methods based on constraint set and gradient geometry.
result Stochastic and adaptive-gradient methods are optimal for quadratically convex constraint sets.
Optimizes K-means clustering with PSO for better accuracy.
problem Improving the accuracy of K-means clustering.
method Uses Particle Swarm Optimization (PSO) to find optimal initial centroids for K-means.
result Optimal centroids found using PSO lead to better clustering accuracy.
Topological Bayesian Optimization finds optimal structures using topological data.
problem Optimizing complex structured data like material or neural network structures.
method Extract topological information from structures using persistent homology, apply Bayesian optimization with kernels for persistence diagrams.
result Topological information improves search efficiency for optimal structures.
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.
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.
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.
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.
Novel approach learns optimal transport using convex neural networks.
problem Learning optimal transport between distributions from samples.
method Solving a minimax optimization to learn two convex functions, representing the optimal transport map.
result The approach finds optimal transport mappings that are independent of initialization and can handle discontinuous distributions.
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.
Visualizes movement control optimization landscapes to understand why it's hard and how to make it easier.
problem Understanding and optimizing movement control problems in animation research.
method Novel visualizations of high-dimensional control optimization landscapes.
result Trajectory optimization becomes increasingly ill-conditioned with longer trajectories, while parameterizing control as partial target states can act as an efficient preconditioner.