New guarantees for adaptive combinatorial maximization with various objectives.
problem Maximizing under cardinality constraints and minimum cost coverage in adaptive settings.
method Bayesian approach with comprehensive approximation guarantees for various utility functions.
result Maximal gain ratio is a new parameter that provides stronger approximation guarantees than greedy policies.
Decision trees algorithms use a gain function to select the best split during the tree's induction. This function is crucial to obtain trees with high predictive accuracy. Some gain functions can suffer from a bias when it compares splits of different arities. Quinlan proposed a gain ratio in C4.5's information gain fu…
The gain-loss ratio is known to enjoy very good properties from a normative point of view. As a confirmation, we show that the best market gain-loss ratio in the presence of a random endowment is an acceptability index and we provide its dual representation for general probability spaces. However, the gain-loss ratio w…
The paper studies optimal investment using acceptability indices to maximize portfolio performance.
problem Optimal investment problem using coherent acceptability indices.
method Numerical algorithm approximating the original problem, dynamic coherent risk measures, set-valued Bellman's principle.
result Acceptability maximization problem reduces to a one-period problem under certain conditions.
Optimal option portfolios under Sharpe Ratio maximization with skew-elliptical t-distributed returns
problem Optimal option portfolios under Sharpe Ratio maximization
method Formulation for explicit portfolio weights
result Different optimal portfolios for Sharpe Ratio and return-to-Value-at-Risk (VaR) ratio
New method boosts BOED using SBI and neural likelihood.
problem Maximizing EIG in BOED with intractable likelihood.
method Neural likelihood estimation, multi-start gradient ascent.
result Significantly improved BOED performance over state-of-the-art.
The ratio of volume to crossing number of a hyperbolic knot is known to be bounded above by the volume of a regular ideal octahedron, and a similar bound is conjectured for the knot determinant per crossing. We investigate a natural question motivated by these bounds: For which knots are these ratios nearly maximal? We…
Study finds no consistent return predictability using payout ratios across 16 countries.
problem Return predictability using payout ratios in various markets.
method Analysis of 16 developed countries' bond, equity, and housing markets using payout-price ratios.
result No consistent in-sample and out-of-sample performance with positive utility gain.
Study asset pricing with reference-dependent preferences, finding matching equity premia.
problem Understanding asset pricing under reference-dependent preferences.
method Discrete-time consumption-based capital asset pricing model with reference-dependent preferences.
result Models can generate equity premia matching empirical estimates, showing procyclical price-dividend ratio and countercyclical equity premium.
New bounds on maximal linkless graphs with improved edge-to-vertex ratios.
problem Finding maximal linklessly embeddable graphs with improved edge-to-vertex ratios.
method Constructing families of graphs and proving necessary and sufficient conditions for clique sums.
result Improved edge-to-vertex ratios for maximal linklessly embeddable graphs.
We define a family of four-point invariants for Shilov boundaries of bounded symmetric domains of tube type, which generalizes the classical four-point cross ratio on the unit circle. This generalization, which is based on a similar construction of Clerc and Ørsted, is functorial and well-behaved under products; these …
Fast algorithms developed for adaptive and fully adaptive submodular maximization problems.
problem Maximizing submodular functions subject to constraints in linear time.
method Developed linear-time algorithms for two submodular maximization problems: adaptive and fully adaptive.
result Achieved (1−1/e−ε) approximation ratio for adaptive submodular maximization and $ rac{1-1/e-ε}{4-2/e-2ε}$ for fully adaptive submodular maximization. Paper connects contrastive learning to MI maximization and establishes robust methods for nonlinear ICA and subspace estimation.
problem Understanding and improving unsupervised representation learning and density ratio estimation.
method The paper connects contrastive learning to MI maximization, establishes new recovery conditions for nonlinear ICA, and proposes a practical outlier-robust method for nonlinear subspace estimation.
result The proposed methods can be seen as maximizing MI, performing nonlinear ICA, or estimating nonlinear subspaces, and are robust to outliers.
Proposes a new method to enhance neural learning by maximizing information gain.
problem Improving neural learning by selecting key variables to maximize information gain.
method Adaptive Ensemble Kalman Filter to quantify uncertainty and maximize information gain.
result The proposed method enables the neural network to learn more effectively from stochastic systems.
Minimal surfaces and average area ratio found to be maximized by hyperbolic metrics.
problem Finding sharp relations between minimal surface entropy and average area ratio.
method Ricci flow with surgery and invariant measures.
result Minimal surface entropy maximized by hyperbolic metrics among metrics with scalar curvature ≥ -6.
New method improves submodular maximization for machine learning applications.
problem Inexact monotonicity in submodular functions limits traditional algorithms' performance.
method Introduces monotonicity ratio as a continuous version of monotonicity, leading to improved approximation guarantees.
result Improved approximation ratios for movie recommendation, quadratic programming, and image summarization.
Novel framework for portfolio selection considering utility and risk.
problem Maximizing utility subject to risk constraints with various utility and risk functionals.
method General framework accommodating non-concave utilities and non-convex risk measures. Characterization of well-posedness using a simple either-or criterion.
result Minimal condition for well-posedness: either utility or risk must be sensitive to large losses.
Omega ratio, defined as the probability-weighted ratio of gains over losses at a given level of expected return, has been advocated as a better performance indicator compared to Sharpe and Sortino ratio as it depends on the full return distribution and hence encapsulates all information about risk and return. We comput…
We note a simple mechanism that may at least partially resolve several outstanding economic puzzles, including why the cyclically adjusted price to earnings ratio of the S&P 500 index has been oddly high for the past two decades, why gains to capital have outpaced gains to wages, and the persistence of the equity premi…
In this paper we investigate the systolic landscape of translation surfaces for fixed genus and fixed angles of their cone points. We furthermore study how the systoles of a translation surface relate to the systoles of its graph of saddle connections. This allows us to develop an algorithm to compute the systolic rati…
New bandit algorithm maximizes information gain.
problem Optimizing decision-making in uncertain environments.
method Approximates information maximization using entropy and free energy principles.
result Asymptotic optimality proven for two-armed bandit problem.
New bounds on IDS for RL show how to balance computation and learning efficiency.
problem Understanding and optimizing information-directed sampling (IDS) for reinforcement learning.
method Developed novel information-theoretic tools to bound information ratio and cumulative information gain.
result Derived prior-free Bayesian regret bounds for IDS in tabular finite-horizon MDPs and improved computational efficiency.
New Finsler metric on sphere disproves systolic ratio conjecture.
problem Proving the maximal systolic ratio on 2-sphere.
method Inspired by Cossarini-Sabourau, constructs a Finsler metric.
result Systolic ratio of new Finsler metric is 4π/3. The paper proposes an asset allocation strategy using the Sortino ratio for better performance.
problem Traditional asset allocation methods like the Sharpe ratio do not penalize negative returns adequately.
method The Sortino ratio is used to maximize asset allocation, penalizing only negative return variances.
result The Sortino ratio-based strategy outperforms traditional methods like the Kelly criterion.
Given a quasisymmetric homeomorphism φ of the circle, Bonsante and Schlenker proved the existence and uniqueness of the minimal Lagrangian extension fφ:H2→H2 to the hyperbolic plane. By previous work of the author, its maximal dilatation satisfies $\log K(f_\varphi)\leq C||\varphi…
A new method for experimental design focuses on predicting downstream quantities of interest.
problem Designs that maximize parameter learning may not maximize downstream quantity prediction.
method Likelihood-free goal-oriented optimal experimental design (LF-GO-OED) using ABC density ratio estimation.
result LF-GO-OED maximizes the expected information gain for downstream quantities.
New framework estimates treatment effects based on preferences.
problem Estimating treatment effects with flexible outcomes.
method Preference-based Conditional Treatment Effect (CPTE) framework.
result CPTE provides interpretable targets and new identifiability conditions.
Let S be a closed orientable surface of genus at least 2 and let G be a semisimple real algebraic group of non-compact type. We consider a class of representations from the fundamental group of S to G called positively ratioed representations. These are Anosov representations with the additional condition that certain …
Alpha-based performance evaluation may fail to capture correlated residuals due to model errors. This paper proposes using the Generalized Information Ratio (GIR) to measure performance under misspecified benchmarks. Motivated by the theoretical link between abnormal returns and residual covariance matrix, GIR is deriv…
New algorithm maximizes non-monotone adaptive submodular functions in linear time.
problem Maximizing non-monotone adaptive submodular functions subject to a cardinality constraint.
method Developed a linear-time algorithm for non-monotone adaptive submodular maximization.
result Achieved a 1/e−ε approximation ratio with O(nε−2logε−1) value oracle queries. We experimentally achieve a 19% capacity gain per Watt of electrical supply power in a 12-span link by eliminating gain flattening filters and optimizing launch powers using machine learning by deep neural networks in a massively parallel fiber context.
Active inference minimizes expected free energy for optimal behavior.
problem Understanding and optimizing behavior in complex systems.
method Combines Bayesian decision theory, optimal Bayesian design, and the free energy principle.
result Active inference emerges as a unified framework for information-seeking, utility maximization, and goal-directed behavior.
The Sharpe ratio is a way to compare the excess returns (over the risk free asset) of portfolios for each unit of volatility that is generated by a portfolio. In this paper we introduce a robust Sharpe ratio portfolio under the assumption that the risk free asset is unknown. We propose a robust portfolio that maximizes…
Optimizes PnL using linear signals in quantitative finance.
problem Maximizing profit and loss in financial trading.
method Unsupervised machine learning approach that maximizes Sharpe Ratio through linear relationships and parameter optimization.
result Empirical validation and effectiveness of the model on U.S. Treasury ETF.
The signal-noise ratio of a portfolio of p assets, its expected return divided by its risk, is couched as an estimation problem on the sphere. When the portfolio is built using noisy data, the expected value of the signal-noise ratio is bounded from above via a Cramer-Rao bound, for the case of Gaussian returns. The bo…
Proposes a new model to maximize out-of-sample Sharpe ratios by forecasting tangency portfolios.
problem Maximizing Sharpe ratios when returns and covariances are not stationary.
method Forecast the tangency portfolio using vector autoregressions and invest in the minimum Euclidean distance portfolio.
result Empirically validated superior out-of-sample Sharpe ratios.
In this paper we investigate the expected terminal utility maximization approach for a dynamic stochastic portfolio optimization problem. We solve it numerically by solving an evolutionary Hamilton-Jacobi-Bellman equation which is transformed by means of the Riccati transformation. We examine the dependence of the resu…
New method corrects active learning for distribution shifts and outliers.
problem Conventional active learning methods fail to account for test-time distribution.
method JEPIG, a hybrid of BALD and EPIG, maximizes expected predictive information gain.
result JEPIG outperforms conventional methods in active learning with distribution shifts.
InfoTree improves reinforcement learning by optimizing tool use with a greedy submodular approach.
problem Maximizing information from tool use in reinforcement learning with limited resources.
method Formalizes Rollout Informativeness, recasts state selection as submodular maximization, and uses UUCB and ABA.
result InfoTree outperforms existing methods across various benchmarks, improving performance by 18.2% on average.
We give upper bounds on the principal curvatures of a maximal surface of nonpositive curvature in three-dimensional Anti-de Sitter space, which only depend on the width of the convex hull of the surface. Moreover, given a quasisymmetric homeomorphism φ, we study the relation between the width of the convex hull of th…
GA-MSSR optimizes forex trading rules for higher returns and reduced risk.
problem Noisy market data affects the consistency and profitability of trading algorithms.
method Optimized trading rules derived from technical indicators using a Genetic Algorithm.
result GA-MSSR achieved superior performance with significant positive returns and reduced risk factors.
Proves local maximizers for higher Ekeland-Hofer capacities in 4D star-shaped domains.
problem Finding local maximizers for higher Ekeland-Hofer capacities in specific domains.
method Analogous to 4D local Viterbo conjecture, proving maximizers for rational ellipsoids.
result Local maximizers of the k-th Ekeland-Hofer capacities are symplectomorphic to rational ellipsoids.
Paper optimizes classification of distributions using Wasserstein metric.
problem Classifying instances represented by distributions on a vector space.
method Maximizing Fisher's ratio in the Wasserstein metric space through iterative algorithm.
result The method enhances classification performance and is robust to variations in distribution summaries.
A new method for multi-objective Bayesian optimization using entropy search and variational lower bound maximization.
problem Efficiently optimizing multiple objectives in continuous domains.
method Approximates the Pareto-frontier using a mixture distribution and optimizes the balance through variational lower bound maximization.
result Demonstrated effectiveness especially with many objective functions.
The construction of efficient and effective decision trees remains a key topic in machine learning because of their simplicity and flexibility. A lot of heuristic algorithms have been proposed to construct near-optimal decision trees. ID3, C4.5 and CART are classical decision tree algorithms and the split criteria they…
Investors can enhance their portfolios by strategically using LETFs, especially with dynamic strategies.
problem Unsuitability of passive or static approaches to LETFs leads to undesirable risk-return profiles.
method Demonstrated the effectiveness of simple dynamic strategies in exploiting favorable Omega ratio dynamics.
result Dynamic strategies can exploit the compounding effect of LETFs, improving risk-return profiles.
New active learning strategy improves decision-making accuracy.
problem Maximizing decision-making accuracy in sequential data acquisition.
method Introduces a novel active learning criterion that maximizes expected information gain on the posterior decision distribution.
result Improved performance in decision-making accuracy compared to existing alternatives.
Submodular functions are a broad class of set functions, which naturally arise in diverse areas. Many algorithms have been suggested for the maximization of these functions. Unfortunately, once the function deviates from submodularity, the known algorithms may perform arbitrarily poorly. Amending this issue, by obtaini…