We aim to construct the optimal solutions to the undiscounted continuous-time infinite horizon optimization problems, the objective functionals of which may be unbounded. We identify the condition under which the limit of the solutions to the finite horizon problems is optimal for the infinite horizon problems under th…
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
48 results for “Optimal Construction”
We generalize optimal inequalities of C. Loewner and M. Gromov, by proving lower bounds for the total volume in terms of the homotopy systole and the stable systole. Our main tool is the construction of an area-decreasing map to the Jacobi torus, streamlining and generalizing the construction of the first author in col…
This thesis tackles Gaussian Process challenges in low dimensions.
problem Constructing models for large datasets and selecting optimal models.
method Samplet-based approach to efficiently construct and train Gaussian Processes.
result Reduces cubic computational complexity to log-linear scale.
Optimizes portfolio construction using Bayesian methods and variational techniques.
problem Balancing reward and risk in portfolio construction.
method Bayesian decision-theoretic formulation, saddle-point problem, variational Bayes relaxation, efficient algorithm, provable convergence.
result Proves statistical consistency of proposed decision with optimal Bayesian decision.
A new random forest algorithm improves tree construction for optimal performance.
problem Improving the performance of random forests, especially in complex and smooth scenarios.
method Adaptive split-balancing method using permutation-based splitting criterion.
result Achieves minimax optimality under various Lipschitz and Hölder classes.
RYU framework constructs safe regions for optimization problems.
problem Optimization problems with specific component functions.
method RYU framework for constructing safe regions.
result RYU framework improves upon state-of-the-art methods.
Constructs optimal symplectic connections for Kaehler metrics on holomorphic submersions.
problem Finding canonical relatively Kaehler metrics on holomorphic submersions.
method Extremal Kaehler metrics, optimal symplectic connections, and adiabatic classes.
result Constructs Kaehler metrics with constant scalar curvature and extremal metrics.
Principal components analysis (PCA) is the optimal linear auto-encoder of data, and it is often used to construct features. Enforcing sparsity on the principal components can promote better generalization, while improving the interpretability of the features. We study the problem of constructing optimal sparse linear a…
The paper presents a framework for optimizing crypto-currency portfolios using generative models.
problem Optimizing crypto-currency portfolios using generative models.
method The approach involves evaluating diverse pairings of generative model forecasts and objective functions, using simulations and blending strategies.
result Eclectic blended portfolios outperform individual generative model-based portfolios.
We establish an optimal gluing construction for general relativistic initial data sets. The construction is optimal in two distinct ways. First, it applies to generic initial data sets and the required (generically satisfied) hypotheses are geometrically and physically natural. Secondly, the construction is completely …
We construct and study market models admitting optimal arbitrage. We say that a model admits optimal arbitrage if it is possible, in a zero-interest rate setting, starting with an initial wealth of 1 and using only positive portfolios, to superreplicate a constant c>1. The optimal arbitrage strategy is the strategy for…
Community detection improves stock market portfolio optimization.
problem Improving portfolio optimization in financial markets.
method Community detection in correlation-based networks of worldwide stock markets.
result Portfolios constructed using community detection outperform traditional methods.
Dictionaries are collections of vectors used for representations of random vectors in Euclidean spaces. Recent research on optimal dictionaries is focused on constructing dictionaries that offer sparse representations, i.e., -optimal representations. Here we consider the problem of finding optimal dictionaries …
Paper establishes lower bounds for finite-sum optimization problems using novel construction methods.
problem Lower complexity bounds for finite-sum optimization problems with various component functions.
method Developed novel approach to construct hard instances and analyzed PIFO algorithms.
result Established lower complexity bounds for convex-concave and nonconvex-strongly-concave objectives.
Considering the classification problem, we summarize the nonparallel support vector machines with the nonparallel hyperplanes to two types of frameworks. The first type constructs the hyperplanes separately. It solves a series of small optimization problems to obtain a series of hyperplanes, but is hard to measure the …
A construction of (t,s)-sequences with finite-row generating matrices using global function fieldsmath.NT
For any prime power and any dimension , we present a construction of -sequences in base with finite-row generating matrices such that, for fixed , the quality parameter is asymptotically optimal as a function of as . This is the first construction of -sequences th…
The main purpose of this paper is to analyze solutions to a fully nonlinear parabolic equation arising from the problem of optimal portfolio construction. We show how the problem of optimal stock to bond proportion in the management of pension fund portfolio can be formulated in terms of the solution to the Hamilton-Ja…
DSPO optimizes portfolio construction from raw stock data efficiently.
problem Manual design and misalignment in traditional portfolio construction methods.
method End-to-end neural network framework with Monotonical Logistic Regression loss.
result DSPO constructs optimal sorted portfolios with high performance metrics.
Optimizes portfolios to minimize tax liability, even with monthly trading restrictions.
problem Minimizing tax liability in portfolio construction while adhering to trading restrictions.
method Uses convex optimization to handle the non-convex tax-aware portfolio construction problem, customizing the approach to avoid wash sales.
result The method produces near-optimal trade lists with significantly reduced computational effort compared to globally optimal solutions.
Paper proposes a new method to optimize feature coordinates for better image classification.
problem Improving feature extraction for better machine learning classification.
method Mutual-energy inner product optimization method.
result The method enhances low-frequency features and suppresses high-frequency noise, leading to better classification results.
Constructs supermartingale couplings with full marginals constraints.
problem Optimal transport for supermartingale couplings with multiple marginals.
method Markovian iteration of one-period optimal supermartingale couplings.
result Explicit construction of supermartingale processes solving optimal transport problem.
Improved Markowitz method handles uncertainty in return forecasts.
problem Uncertainty in return statistics forecasts.
method Convex optimization with practical constraints.
result Handles uncertainty gracefully and efficiently.
Paper develops a new method for game options in local volatility models.
problem Optimal stopping in one-dimensional diffusion with general coefficients.
method Skorokhod embedding to construct recombining tree approximations.
result Construct nearly optimal stopping times with convergence rates.
We consider a spread financial market defined by the multidimensional Ornstein--Uhlenbeck (OU) process. We study the optimal consumption/investment problem for logarithmic utility functions in the base of stochastic dynamical programming method. We show a special Verification Theorem for this case. We find the solution…
Trading multiple mean reversionq-fin.MF
Solves optimal control for trading multiple mean-reverting assets.
problem How to construct a portfolio from mean-reverting assets.
method Optimal control problem for power utility agent.
result Nearly explicit solution with properties of optimal solution.
Study compares optimal vs. naive diversification in crypto markets, finds time-varying moments improve performance.
problem Optimizing portfolio construction in volatile crypto markets.
method Examines time-varying moments and transaction costs, incorporates turnover penalty.
result Time-varying moment estimators outperform conventional estimators in practical portfolio construction.
Optimizes bond portfolios to avoid worst-case losses.
problem Finding the worst-case value of a bond portfolio over a range of yield curves and spreads.
method Solves a convex-concave saddle point optimization problem to find the worst-case value and construct a robust portfolio.
result Constructs a bond portfolio that includes the worst-case value, ensuring robustness against market uncertainties.
Optimizes sparse mean-reverting portfolios for higher returns.
problem Finding optimal stock weights for mean-reverting portfolios.
method Transformed optimization problem into SDP, added constraints.
result Sparse mean-reverting portfolios provide higher returns with transaction costs.
Optimizes private statistics with noisy methods.
problem Private inference in statistical models.
method Noisy optimization for M-estimators and confidence regions.
result Private estimators converge to non-private ones with high probability.
Optimal ReLU networks can memorize any separable set of points with a small number of parameters.
problem The optimal number of parameters required to memorize a set of points using ReLU networks.
method Construction of ReLU networks with specific bit complexity to memorize points satisfying a mild separability assumption.
result Optimal ReLU networks can memorize any separable set of points with a number of parameters that is .
For an infinite-horizon continuous-time optimal stopping problem under non-exponential discounting, we look for an optimal equilibrium, which generates larger values than any other equilibrium does on the entire state space. When the discount function is log sub-additive and the state process is one-dimensional, an opt…
Constructs a space for stable holomorphic submersions over a fixed base.
problem Stability of holomorphic submersions over a compact Kaehler base.
method Geometric invariant theory combined with geometric PDEs.
result Moduli space is a Hausdorff complex space with a Weil-Petersson type Kaehler metric.
Adaptive, sparse graphs improve learning performance.
problem Inappropriate kNN for varying sampling density or noise.
method Quadratically regularised optimal transport.
result Graphs outperform kNN in learning applications.
This paper investigates the question of which smooth compact 4-manifolds admit Riemannian metrics that minimize the L2-norm of the curvature tensor. Metrics with this property are called OPTIMAL; Einstein metrics and scalar-flat anti-self-dual metrics provide us with two interesting classes of examples. Using twistor m…
On Uncertainty Estimation by Tree-based Surrogate Models in Sequential Model-based Optimizationstat.ML
A new tree-based model improves uncertainty estimation in sequential optimization.
problem Improving uncertainty estimation in sequential model-based optimization.
method Proposed a new ensemble of randomized trees (BwO forest) with bagging and oversampling.
result BwO forest outperforms existing tree-based models in various optimization scenarios.
One of the goals of the ICML workshop on representation and learning is to establish benchmark scores for a new data set of labeled facial expressions. This paper presents the performance of a "Null" model consisting of convolutions with random weights, PCA, pooling, normalization, and a linear readout. Our approach fo…
Heuristic algorithm for portfolio optimization reduces solve times to milliseconds.
problem Mean-variance portfolio optimization with various constraints.
method Alternating Direction Method of Multipliers (ADMM).
result Achieves performance bounds and solves problems in milliseconds.
Study dynamic Pareto-optimal allocations in multi-period economies with time-consistent risk measures.
problem Optimal allocation in multi-period pure-exchange economies with stochastic endowments and time-consistent risk measures.
method Introduced dynamic Pareto-optimal allocation processes and derived recursive and comonotone improvement theorems.
result Dynamic Pareto-optimal allocation processes can be constructed recursively and are comonotone.
The paper constructs optimal sub-Riemannian geodesics in specific Carnot groups.
problem Optimal paths in sub-Riemannian geometry for certain groups.
method Explicit construction of geodesics using symmetries and the Hadamard technique.
result Identification of cut time and cut locus in the constructed geodesics.
The portfolio optimization problem is a basic problem of financial analysis. In the study, an optimization model for constructing an options portfolio with a certain payoff function has been proposed. The model is formulated as an integer linear programming problem and includes an objective payoff function and a system…
Study of 2D Lorentzian anti-de Sitter plane using geometric control theory.
problem Understanding extremal trajectories and reachable set on anti-de Sitter plane.
method Geometric control theory and differential geometry.
result Construction of optimal synthesis and description of Lorentzian distance.
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 …
The aim of this paper is to construct and analyze solutions to a class of Hamilton-Jacobi-Bellman equations with range bounds on the optimal response variable. Using the Riccati transformation we derive and analyze a fully nonlinear parabolic partial differential equation for the optimal response function. We construct…
New method creates coresets for deep neural networks efficiently.
problem Efficiently handling large data streams with limited resources.
method Cardinality-constrained bilevel optimization for deep neural networks.
result Demonstrated efficient generation of coresets for deep neural networks.
We propose and analyze StoROO, an algorithm for risk optimization on stochastic black-box functions derived from StoOO. Motivated by risk-averse decision making fields like agriculture, medicine, biology or finance, we do not focus on the mean payoff but on generic functionals of the return distribution. We provide a g…
Optimal Bond Portfoliosmath.OC
We aim to construct a general framework for portfolio management in continuous time, encompassing both stocks and bonds. In these lecture notes we give an overview of the state of the art of optimal bond portfolios and we re-visit main results and mathematical constructions introduced in our previous publications (Ann.…
The paper optimizes portfolios using clustering and Sharpe ratio-based optimization.
problem Optimizing portfolio performance in financial modeling.
method Combines K-Means clustering for asset segmentation and Sharpe ratio-based optimization.
result Optimized portfolios outperform traditional equal-weighted benchmarks.
This paper studies robust forward investment and consumption preferences within a zero-volatility context. Different from previous works, we consider an incomplete financial market model due to general investment portfolio constraints. We provide a new PDE characterization and a novel semi-explicit saddle-point constru…