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

1122 · Jun 202219922001200920172026
23 results for log-optimality

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.

Paper proposes a method to solve log-optimal portfolios under ambiguous return distributions.

problem Maximizing wealth growth with unknown return distributions.
method Supporting hyperplane approximation to reformulate the problem into a linear program.
result The problem can be solved efficiently, even with transaction costs and diversification.

We proposed a new Portfolio Management method termed as Robust Log-Optimal Strategy (RLOS), which ameliorates the General Log-Optimal Strategy (GLOS) by approximating the traditional objective function with quadratic Taylor expansion. It avoids GLOS's complex CDF estimation process,hence resists the "Butterfly Effect" …

2018-05-01abs ↗pdf ↗

Investigates how rebalancing frequency and transaction costs affect log-optimal portfolios.

problem Impact of rebalancing frequency and transaction costs on log-optimal portfolios.
method Proved equivalence to concave program, derived optimality conditions, tested using intraday and daily data.
result Transaction costs can cause bankruptcy for frequency-dependent log-optimal portfolios, approximating to quadratic concave program.

The paper analyzes log-optimal portfolios in markets with random time events.

problem Analyzing log-optimal portfolios in markets with random events.
method Examined a market model with two information flows, F and G, and addressed log-optimal portfolio existence and sensitivity.
result Identified necessary and sufficient conditions for log-optimal portfolio existence, types of risks induced by random time, and factors affecting sensitivity.

This paper shows a buy-and-hold strategy is asymptotically log-optimal for a market with a dominant asset.

problem Finding a safe and optimal investment strategy in a market with a dominant asset.
method Investment strategy based on the dominant asset and buy-and-hold approach.
result Buy-and-hold strategy on the dominant asset is asymptotically log-optimal with a sublinear rate of convergence.

Study online monotone density estimation with expert aggregation and log-optimal calibration.

problem Online monotone density estimation and log-optimal calibration.
method Proposed two online estimators: Grenander estimator and expert aggregation estimator.
result Online estimators achieve O(n1/3)O(n^{1/3}) cumulative log-likelihood gap and nlogn\sqrt{n\log{n}} pathwise regret bound.

Survival strategies in a market with self-determined prices are closely tied to log-optimal investment.

problem Survival of wealth in a market with endogenous prices.
method Assume only one's actions affect prices, use log-optimal strategy, disregard actual prices.
result Survival strategies are asymptotically close to log-optimal strategies.

This paper tackles cost-sensitive portfolio optimization under ambiguous return distributions.

problem Tackles cost-sensitive distributionally robust log-optimal portfolio problem with ambiguous return distributions.
method Uses Wasserstein metric for distributional ambiguity, incorporates convex transaction costs, and approximates infinite-dimensional problem with finite convex program.
result Establishes conditions for robustly survivable trades and validates theoretical framework with empirical studies.

A new portfolio model improves on Kelly's by accounting for estimation error.

problem Estimation error in Kelly portfolio optimization.
method Wasserstein distributionally robust optimization (DRO) to define a robust log-optimal portfolio.
result The Wasserstein-Kelly portfolio outperforms the Kelly portfolio in out-of-sample testing.

Bayes-assisted confidence sequences improve efficiency for bounded means.

problem Efficient uncertainty quantification for bounded IID means without parametric assumptions.
method Bayesian working predictive model selects adaptive martingale updates maximizing predictive log-growth.
result Asymptotically log-optimal performance with informative priors reducing width and sampling effort.

Investigates optimal portfolio strategies in markets with latent side information.

problem Investment problem in markets with latent dependence structure and side information.
method Dynamic and constant portfolio strategies, analyzing log-optimal portfolio as benchmark.
result Optimal dynamic strategy growth rate asymptotically converges to constant strategy in stationary markets.

The paper analyzes optimal overbetting strategies for a satellite investment account.

problem Optimal control of leverage in a satellite investment account with limited leverage.
method Recursive overbetting strategy to maximize growth rate, solved via HJB equation.
result Optimal overbetting strategy balances growth rate of satellite and composite bankroll.

Investor optimizes wealth in a market with non-traded endowment, deriving expansions up to second order.

problem Optimizing wealth in an incomplete financial market with a non-traded endowment.
method Duality techniques and Kunita-Watanabe projections for deriving expansions up to second order.
result Derives expansions of the primal value function and optimal wealth process up to second order with respect to the non-traded endowment units.

This paper tackles robust control of noisy systems with uncertain distributions.

problem Optimal control of sampled-data stochastic systems with multiplicative noise and distributional ambiguity.
method Develops a convex relaxation to handle the ``concave-max'' geometry and derives a probabilistic performance guarantee.
result Derives an explicit, non-asymptotic bound on the duality gap and proves robust viability conditions.