The study compares ASP encodings for sequential pattern mining tasks.
problem Efficiency of Answer Set Programming (ASP) encodings for sequential pattern mining.
method Two representations of embeddings (fill-gaps vs skip-gaps) and various types of patterns were tested.
result Fill-gaps strategy is more efficient on real problems due to lower memory consumption.
Robust PCA detects anomalies and fills gaps in seasonal time series data.
problem Anomaly detection and data imputation in seasonal time series.
method Online robust PCA framework for temporal observations.
result Empirically compared and showed effectiveness in practical situations.
MO-GP models fill gaps in biophysical data with across-domain info transfer.
problem Gap filling of biophysical parameters LAI and fAPAR over rice areas.
method Multi-output Gaussian Processes (MO-GP) based on Linear Model of Coregionalization (LMC).
result MO-GP models successfully predict biophysical variables even in high missing data regimes.
Machine learning and sparse sensing predict shim gaps in aircraft assembly.
problem Time-consuming and costly gap filling in aircraft assembly.
method Robust principal component analysis and optimized sparse sensing.
result 99% of shim gaps predicted within desired tolerance using 3% of scan points.
Develops differential KO-theory with constructions and applications.
problem Constructing differential refinements in KO-theory.
method Explicit constructions and refinements of spectral sequences.
result Identification of differentials in differential KO-theory.
New insights into natural exponential families improve regret bounds for bandit problems.
problem Improving regret bounds for bandit problems with subexponential tails.
method Proving self-concordance for natural exponential families and applying to bandits.
result Optimistic algorithms for generalized linear bandits have second-order regret bounds that are free of an exponential dependence on problem parameters.
Computational knot theory and 3-manifold topology have seen significant breakthroughs in recent years, despite the fact that many key algorithms have complexity bounds that are exponential or greater. In this setting, experimentation is essential for understanding the limits of practicality, as well as for gauging the …
Proposes a recourse algorithm for machine learning decisions.
problem Individuals can suffer unfair outcomes in black-box systems.
method Models data distribution, generates smallest changes for improvement.
result Algorithm applicable to supervised and causal systems.
New algorithm fills gaps in offline data for hybrid RL, achieving similar gains without coverage assumptions.
problem Lack of provable benefits in hybrid RL with coverage assumptions.
method Warm-starting optimistic online algorithms with offline data in experience replay buffer.
result Hybrid RL gains similar to offline-only RL without coverage assumptions, demonstrating efficient exploration.
New geometries defined for string models, filling gaps in the literature.
problem Developing mathematical structures for string models.
method Defining E-metric-connection geometries and locality structures.
result Unified framework for metric-affine and generalized geometries.
This study analyzes mutual influence on investment strategies of financial market agents.
problem Mutual influence among agents in financial markets and its impact on investment strategies.
method Formulated optimal investment differential game problem, derived analytical solutions, proposed fast algorithm, and theoretically analyzed mutual influence.
result Agents' optimal strategies converge to the asymptotic strategy when mutual influence is strong and approaches infinity.
Trading strategies are limited by position limits, leading to a finite number of unique strategies.
problem Limiting the number of long and short positions in trading strategies.
method Formulas and distributions derived for the number of unique trading strategies, transactions, and do-nothing actions.
result A discrete distribution of actions and their properties are presented.
Paper proposes a new framework for combining investment strategies without market-specific assumptions.
problem Lack of a distribution-free and consistent preference framework for decision-making in combining investment strategies.
method Introduces a novel framework for decision-making in combining strategies, free from market conditions and statistical assumptions.
result Proposed strategies outperform individual component strategies in long-term wealth accumulation, with small tradeoffs in Sharpe ratios.
Investment strategies ensure wealth bounded away from zero in a competitive market.
problem Ensuring wealth bounded away from zero in a competitive investment market.
method Stochastic game-theoretic model with survival strategies.
result Survival strategies are asymptotically equivalent and allow faster wealth accumulation.
Study improves StarCraft bot's strategy selection with partial observations.
problem Selecting effective strategies in real-time strategy games with limited information.
method Utilized full game state information during training to predict opponent strategies.
result Substantial win rate improvements over a fixed-strategy baseline.
This paper introduces strategies to maximize arbitrage profits in decentralized exchanges.
problem Maximizing profits from arbitrage loops in decentralized exchanges.
method Three strategies: MaxPrice, MaxMax, and Convex Optimization.
result The Convex Optimization strategy yields the highest monetized arbitrage profit in theory and practice.
In this paper we propose an investing strategy based on neural network models combined with ideas from game-theoretic probability of Shafer and Vovk. Our proposed strategy uses parameter values of a neural network with the best performance until the previous round (trading day) for deciding the investment in the curren…
Automated strategies improve model adaptation efficiency.
problem Manual adaptation strategies are time-consuming and costly.
method Flexible adaptive mechanism deployment for automated adaptation strategies.
result Automated strategies achieve better or comparable performance.
New trading strategies yield gains on average in various market scenarios.
problem Developing trading strategies that consistently yield positive gains in different market conditions.
method Introducing generalized statistical arbitrage concepts and profitable strategies based on information systems.
result Constructed profitable generalized strategies with good performance on simulated and real market data.
Stratify unifies and improves multi-step forecasting strategies.
problem Lack of unified frameworks for multi-step forecasting strategies.
method Proposes Stratify, a parameterized framework for multi-step forecasting.
result Novel strategies in Stratify outperform existing ones in over 84% of experiments.
New method selects best exploration strategies in uncertain environments.
problem Selecting optimal strategies in unknown, multi-strategy environments.
method Formulates Multi-Armed Bandits problem with diversity of effects as reward signal.
result Method outperforms fixed mixtures of strategies in diverse, challenging conditions.
Study finds mean reversion strategies perform well on historical data but fail in recent market conditions.
problem Performance of mean reversion strategies in recent market data.
method Empirical investigation of three mean reversion strategies (PAMR, OLMAR, TCO) on historical S&P 500 data and benchmark datasets.
result Mean reversion strategies may fail in recent market conditions, especially with transaction costs.
Study examines volatility-based strategy for Chinese ETF options, improving returns in volatile markets.
problem Lack of effective trading strategies in volatile Chinese equity markets.
method Volatility forecasting using GARCH models to dynamically adjust positions and exposures.
result Dynamic adjustment of positions and exposures enhances returns in volatile markets.
Model shows how heterogeneity in strategies and risk tolerance affects financial market stability.
problem Understanding how heterogeneity impacts financial market dynamics.
method Agent-based model incorporating heterogeneous investment strategies and risk tolerance.
result Heterogeneity in strategies and risk tolerance suppresses price fluctuations.
Optimal order execution strategies for brokers under reference benchmarks.
problem Maximizing broker's utility of excess profit-and-loss subject to reference strategies.
method Formulated as a utility maximization problem, optimal strategies derived in closed form.
result General reference strategies can be approximated by piece-wise linear combinations of IS and TC orders.
The paper develops a mathematical model for strategic shifts.
problem Finding optimal moments for strategy changes in market dynamics.
method Explicit strategy formulation using fluctuation theory.
result Analytical results predict optimal strategy shifts.
New trading strategy beats traditional grid in crypto markets.
problem Low expected return of traditional grid trading strategy.
method Dynamic Grid Trading (DGT) strategy that adapts to market conditions.
result DGT strategy outperforms traditional grid and buy-and-hold strategies.
A new approach to continuous-time universal portfolios using pathwise Itô calculus.
problem Continuous-time version of Cover's universal portfolio strategies.
method Pathwise Itô calculus approach to establish existence and properties of universal portfolio strategies.
result The universal portfolio strategy's portfolio value process is the average of all values of constant rebalanced strategies.
New method solves continuous time mean-variance model for consistent investment strategy.
problem Time-consistent optimal strategy for continuous time mean-variance model.
method Developed a new Bellman principle method.
result Obtained a time-consistent dynamic optimal strategy.
Paper introduces dynamic strategies for multi-period investment models.
problem Optimizing investment strategies over multiple periods with risk and return considerations.
method Developed a Bellman principle for discrete time multi-period mean-variance models, leading to dynamic optimal strategies and efficient frontiers.
result Dynamic optimal strategies can achieve higher returns with lower risk compared to the 1/n strategy.
We introduce a new general framework for constructing the best trading strategy for a given historical indicator. We construct the unique trading strategy with the highest expected return. This optimal strategy may be implemented directly, or its expected return may be used as a benchmark to evaluate how far away from …
A strategy ensures maximal wealth growth in competitive asset markets.
problem Maximizing wealth growth in competitive asset markets.
method Game-theoretic model and proof of existence of a submartingale strategy.
result Existence and uniqueness of a submartingale strategy that maximizes wealth growth.
A game theory study on optimal hiding and searching strategies in discrete locations.
problem Optimal hiding and searching strategies in a two-person zero-sum game between a hider and a searcher.
method Proved the existence of optimal strategies, developed an algorithm to compute them, and compared with a simple strategy.
result Optimal hiding strategy involves hiding in each location with nonzero probability, and optimal searching strategy can be constructed with up to n simple sequences.
Global optimization in Bayesian inference yields little additional benefit.
problem Improving psychometric parameter estimation using global optimization strategies.
method Experimental simulations comparing myopic and global strategies in multiple models.
result Global optimization strategies provide negligible additional utility improvement beyond the immediate next steps.
The author proposes a finance trading strategy named Entropy Oriented Trading and apply thermodynamics on the strategy. The state variables are chosen so that the strategy satisfies the second law of thermodynamics. Using the law, the author proves that the rate of investment (ROI) of the strategy is equal to or more t…
Study optimal growth strategies in a continuous-time asset market.
problem Guaranteeing that individual agent strategies cannot outperform the market.
method Mean-field approximation of an infinite number of infinitesimal agents, focusing on optimal strategy distribution among assets.
result Optimal strategy for market agents is to invest proportionally to discounted expected relative dividend intensities.
Investment strategy optimized under wealth limits for exponential utility maximization.
problem Maximizing wealth under fixed upper and lower limits for exponential utility.
method Combining optimal investment strategy with options to handle constraints.
result Investment strategy distribution analyzed for change of quantiles.
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.
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 aim of this paper is to compare the performances of the optimal strategy under parameters mis-specification and of a technical analysis trading strategy. The setting we consider is that of a stochastic asset price model where the trend follows an unobservable Ornstein-Uhlenbeck process. For both strategies, we prov…
The paper examines how trading strategies lose value due to stock turnover.
problem Leakage of rank-dependent trading strategies due to stock turnover.
method Theoretical analysis and empirical estimation of leakage in discrete time.
result A new method to estimate leakage in trading strategies is introduced.
Explains classic quantitative strategies and their workings.
problem Debunking the magic behind black-box quantitative strategies.
method Derives from simple intuitions and mathematics, addressing both formal and informal aspects.
result Provides a deeper understanding of quantitative strategies.
Deep RL ensemble strategy outperforms individual algorithms in stock trading.
problem Designing profitable stock trading strategies in a complex market.
method Ensemble of three deep reinforcement learning algorithms (PPO, A2C, DDPG) for stock trading.
result Deep ensemble strategy outperforms individual algorithms and traditional min-variance portfolio.
A deep learning strategy outperforms traditional methods in stocks portfolio management.
problem Optimizing stock portfolio performance using machine learning.
method Deep Deterministic Policy Gradient framework with neural networks.
result Compound annual return rate of 14.12% compared to 7 other strategies.
Optimal trade execution strategies show adaptive methods reduce costs.
problem Optimal trade execution with short-term price predictive signals.
method Comparison of static and adaptive strategies with transient and instantaneous market impacts.
result Adaptive strategies significantly reduce transaction costs compared to static strategies.
New approach discovers active learning strategies for various domains.
problem Finding efficient active learning strategies across different data types.
method Formalized annotation as a Markov decision process, designed universal state and action spaces, introduced a reward function, and used reinforcement learning to find optimal strategies.
result Learned strategies consistently outperform existing methods on multiple unrelated domains.
Study Figgie card game strategies using agent-based simulation.
problem Analyze strategies for Figgie card game and market behavior.
method Develop agent-based discrete-event market simulation to test strategies.
result Fundamentalist strategy is profit-maximizing in all tested combinations.
Algorithm learns optimal trading parameters from technical strategies.
problem Optimizing wealth from technical trading strategies.
method Adversarial expert based online learning algorithm for parameter optimization.
result Aggregated trading strategies outperform benchmarks after accounting for costs.