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.

169,051 papers · 148 categories

Trend · papers per month

81162242323 · Jun 202019922001200920182026
48 results for maximal consistency

New framework for consistent submodular maximization with insertions and deletions.

problem Maintaining near-optimal solutions in a dynamic setting with insertions and deletions.
method Developed a general framework for fully dynamic submodular maximization, instantiated for cardinality and rank-k matroid constraints.
result First constant-factor approximations with sublinear consistency for both cardinality and rank-k matroid constraints.

No arbitrage holds if a Pareto solution exists for vector-valued utility maximization.

problem Existence of no arbitrage in markets with transaction costs and multiple assets.
method Prove no arbitrage condition equivalent to Pareto solution for vector-valued utility maximization.
result A consistent price process can be constructed from the Pareto maximizer.

Proposes a framework to reconcile policy learning and profit maximization in CATE estimation.

problem Aligning CATE estimation with profit maximization for optimal customer treatment decisions.
method Optimizes a novel objective function that concentrates learning capacity near the decision boundary, ensuring consistency with the original profit function.
result Consistent CATE estimates can be recovered from existing profit-maximization pipelines, allowing firms to navigate the trade-off between accuracy and profit.

Monitoring means to observe a system for any changes which may occur over time, using a monitor or measuring device of some sort. In this paper we formulate a problem of monitoring dates of maximal risk of a financial position. Thus, the systems we are going to observe arise from situations in finance. The measuring de…

2009-02-16abs ↗pdf ↗

Develops a novel approach for estimating optimal DTRs with multicategory treatments and censored data.

problem Estimating optimal treatment regimes for chronic diseases with censored data.
method Angle-based multicategory classification algorithm for maximizing conditional survival function.
result The proposed method outperforms existing approaches in maximizing conditional survival function.

If pricing kernels are assumed non-negative then the inverse problem of finding the pricing kernel is well-posed. The constrained least squares method provides a consistent estimate of the pricing kernel. When the data are limited, a new method is suggested: relaxed maximization of the relative entropy. This estimator …

2003-10-15abs ↗pdf ↗

We show that the singularities of spacelike maximal surfaces in Lorentz-Minkowski 3-space generically consist of cuspidal edges, swallowtails and cuspidal cross caps. The same result holds for spacelike mean curvature one surfaces in de Sitter 3-space. To prove these, we shall give a simple criterion for a given singul…

2005-10-18abs ↗pdf ↗

Paper introduces new regression methods for consistent estimation of biophysical parameters.

problem Estimating biophysical parameters while respecting auxiliary variables.
method Linear and nonlinear kernel-based regression models with consistency constraints.
result Models provide closed-form solutions and successfully estimate chlorophyll content.

Efficient algorithm for orthogonal canonical correlation analysis (OCCA).

problem Solving the OCCA problem with orthogonality constraints.
method Sub-maximization problem with self-consistent-field (SCF) iteration for trace-fractional structure and orthogonal linear projections.
result Proposed algorithm converges globally to a KKT point and is more efficient.

The paper studies billiards in symmetric tables and finds a measure bound for maximizing orbits.

problem Understanding the measure of maximizing orbits in symmetric billiard tables.
method Introduced a closed invariant set of locally maximizing orbits and gave an effective bound on its measure.
result An effective bound on the measure of the invariant set in terms of the isoperimetric defect of the curve.

In this paper we study a robust expected utility maximization problem with random endowment in discrete time. We give conditions under which an optimal strategy exists and derive a dual representation for the optimal utility. Our approach is based on a general representation result for monotone convex functionals, a fu…

2017-12-20abs ↗pdf ↗

New findings on hypersurfaces in Euclidean space that are both maximal and minimal.

problem Characterizing hypersurfaces in Euclidean space that are both maximal and minimal.
method Analyzing the level curves of the hypersurfaces and showing they are minimal hypersurfaces in the lower-dimensional Euclidean space.
result The level curves of these hypersurfaces are minimal hypersurfaces in the lower-dimensional Euclidean space.

Study Riemannian geometry of maximal surface group representations in pseudo-hyperbolic space.

problem Characterize the geometry of maximal surface group representations in pseudo-hyperbolic space.
method Introduced a scalar product on the first cohomology group, leading to a Riemannian metric on the smooth locus.
result Found totally geodesic sub-varieties and orbifold structures in the space of representations.

Investment strategy optimizes risk using a specific risk measure.

problem Optimizing investment with risk controlled by a weighted entropic risk measure.
method Investigation of expected utility maximization and risk minimization problems with solutions provided iteratively.
result Explicit characterization of solutions to optimization problems.

Proposes a method to optimize neural network initialization using marginal likelihood maximization.

problem Optimizing hyperparameters for neural network initialization.
method Leverages the connection between neural networks and Gaussian processes to infer optimal hyperparameters.
result Marginal likelihood maximization provides near-optimal prediction performance on MNIST classification tasks.

Investigates optimal strategies under financial uncertainty, proving convergence as uncertainty increases.

problem Utility maximization in financial markets with model uncertainty.
method Explicit representation of optimal strategy, minimax theorem, convergence analysis.
result Optimal strategy converges to a generalized uniform diversification strategy as uncertainty increases.

Bayesian optimization is a sample-efficient approach to global optimization that relies on theoretically motivated value heuristics (acquisition functions) to guide its search process. Fully maximizing acquisition functions produces the Bayes' decision rule, but this ideal is difficult to achieve since these functions …

2018-05-25abs ↗pdf ↗

Paper finds space-like maximal surfaces with entire null lines in 3D space-time.

problem Existence of space-like maximal surfaces containing entire null lines.
method Analyzes surfaces in Lorentz-Minkowski 3-space, proving existence and properties.
result Embedded space-like maximal graphs containing entire null lines exist.

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint kk, with the added twist that a number of items ττ from the returned set may be removed. We focus on the worst-case setting considered in (Orlin et al., 2016), in which a constant-factor approximation guarantee was g…

2017-06-15abs ↗pdf ↗

Optimizes decision-making with variational Bayesian methods for continuous utilities.

problem Inference approximations for continuous utilities without full posterior knowledge.
method Automatic pipeline that co-opts continuous utilities into variational inference algorithms.
result Consistent improvement in decision-making when calibrating approximations for specific utilities.

Optimal allocation between explainable and black box models for high performance and explainability.

problem Balancing explainability and performance in model ensembles.
method Optimal allocation of observations between explainable and black box models to maximize ensemble performance and explainability.
result Learned allocations maintain high ensemble performance and explainability, sometimes outperforming individual models.

The paper tackles VN with multiple vertices of interest and adversarial contamination.

problem Finding corresponding vertices in a graph when some vertices are contaminated.
method Bayes optimality, maximal consistency classes, adversarial contamination model, network regularization.
result VN schemes perform well in uncontaminated settings but are adversely impacted by adversarial contamination.

We develop Fenchel-Nielsen coordinates for representations of surface groups into Sp(2n,R) with maximal Toledo invariant. Analogous to classical Fenchel-Nielsen coordinates on the Teichmüller space they consist of a parametrization of representations of the fundamental group of a pair of pants and a careful investigati…

2012-04-03abs ↗pdf ↗

Maximizes stock portfolio predictability using machine learning.

problem Improving stock portfolio performance through predictive modeling.
method Optimal constrained weights in the MPP constructed using Elastic Net, Random Forest, and Support Vector Regression models.
result MPP portfolios can outperform or underperform the index based on the time period.

The paper solves a portfolio selection problem in incomplete markets by balancing utility and risk.

problem Time-inconsistent portfolio selection in incomplete markets.
method Characterizes equilibrium via a coupled quadratic BSDE system, introduces approximate equilibrium for general cases.
result Established existence theory for equilibrium strategies in special and general cases.

This work studies learning curves for revenue maximization algorithms.

problem Understanding the performance of revenue-maximizing algorithms as they learn from more data.
method Initiates the study of learning curves for revenue maximization, providing a near-complete characterization of their rate of decay.
result Learning curves for revenue maximization can decay arbitrarily slowly or almost exponentially fast, depending on the distribution and optimal revenue.

Software finds ideal polyhedra with rational dihedral angles and volume maxima.

problem Finding ideal convex polyhedra with maximal volume in hyperbolic 3-space.
method Rivin's variational characterization and combinatorial optimization algorithms.
result Maximal volume ideal polyhedra have dihedral angles that are rational multiples of π.

The existence of optimal strategy in robust utility maximization is addressed when the utility function is finite on the entire real line. A delicate problem in this case is to find a "good definition" of admissible strategies, so that an optimizer is obtained. Under suitable assumptions, especially a time-consistency …

2011-09-26abs ↗pdf ↗

VAEs improve representation learning by inverting the data-generating process through self-consistency.

problem VAEs struggle to invert the data-generating process, yet often succeed in representation learning.
method Studied VAEs in the limit of near-deterministic decoders, proving self-consistency and showing ELBO convergence to a regularized log-likelihood.
result VAEs can perform independent mechanism analysis (IMA), recovering true latent factors under specific conditions.

Proposes a method to enhance multi-view learning by maximizing higher order correlations.

problem Losing intrinsic interconnections among multiple views in pairwise correlation maximization.
method Formulates multi-view data as a low rank approximation problem using higher order correlation tensor and solves it with the generating polynomial method.
result Consistently outperforms prior methods on real multi-view data.

Investigates fund separations and stability for long-term optimal investments.

problem Optimizing long-term investments in an incomplete market with risky and safe assets.
method Analyzes three market models with different state variable processes to find optimal portfolios and prove convergence stability.
result Dynamic optimal portfolios converge to static portfolios over time, with vanishing sensitivities in the long run.