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

125251376501 · Jun 202019922001200920172026
48 results for maximal developments

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 (11/eε)(1-1/e-ε) approximation ratio for adaptive submodular maximization and $ rac{1-1/e-ε}{4-2/e-2ε}$ for fully adaptive submodular maximization.

In this paper, we use replica analysis to determine the investment strategy that can maximize the net present value for portfolios containing multiple development projects. Replica analysis was developed in statistical mechanical informatics and econophysics to evaluate disordered systems, and here we use it to formula…

2018-10-15abs ↗pdf ↗

Establishes existence of maximal globally hyperbolic development for Einstein equations.

problem Initial value problem for generalised Einstein equations.
method Generalised Lorentz gauge, adapted from Ringström's approach.
result Existence and geometric uniqueness of maximal globally hyperbolic development.

Dictionary learning is a classic representation learning method that has been widely applied in signal processing and data analytics. In this paper, we investigate a family of p\ell_p-norm (p>2,pNp>2,p \in \mathbb{N}) maximization approaches for the complete dictionary learning problem from theoretical and algorithmic asp…

2020-02-24abs ↗pdf ↗

A note on utility maximization with costs, proving trading strategies.

problem Utility maximization with proportional transaction costs and stability of optimal portfolios.
method Proof of a limit theorem using a dual approach.
result Established a uniqueness result for optimal trading strategies.

We investigate a certain class of solvable metric Lie algebras. For this purpose a theory of twofold extensions associated to an orthogonal representation of an abelian Lie algebra is developed. Among other things, we obtain a classification scheme for indecomposable metric Lie algebras with maximal isotropic centre an…

2002-09-26abs ↗pdf ↗

The study explores maximal symmetry in Ricci solitons on Lie groups.

problem Maximal symmetry in left-invariant Riemannian metrics and Ricci solitons.
method Analysis of left-invariant metrics and Ricci solitons on Lie groups, using tools from previous work on Einstein metrics.
result Expanding homogeneous Ricci solitons have maximal isometry algebras but not always maximal isometry groups.

The elaboration of new quantization methods has recently developed the interest in the study of subalgebras of the Lie algebra of polynomial vector fields over a Euclidean space. In this framework, these subalgebras define maximal equivariance conditions that one can impose on a linear bijection between observables tha…

2000-09-28abs ↗pdf ↗

We give lower bounds on the maximal injectivity radius for a closed orientable hyperbolic 3-manifold M with first Betti number 2, under some additional topological hypotheses. A corollary of the main result is that if M has first Betti number 2 and contains no fibroid surface then its maximal injectivity radius exceeds…

2009-01-30abs ↗pdf ↗

Study utility maximization with delayed information in continuous time Gaussian markets.

problem Maximizing utility with delayed information in continuous time Gaussian markets.
method Purely probabilistic approach based on Radon-Nikodym derivatives of Gaussian measures.
result Solution for optimal control and value in a specific Gaussian framework.

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a stochastically independent uniformly distributed unit vector. When the set of unit vectors …

2015-11-19abs ↗pdf ↗

The notion of maximal extension of a globally hyperbolic space-time arises from the notion of maximal solutions of the Cauchy problem associated to the Einstein's equations of general relativity. In 1969 Choquet-Bruhat and Geroch proved that if the Cauchy problem has a local solution, this solution has a unique maximal…

2013-06-17abs ↗pdf ↗

Study maximal representations of surface groups via pleated surfaces in pseudo-Riemannian space.

problem Maximal representations of surface groups and their geometric properties.
method Introduction of ρ\rho-invariant pleated surfaces and construction of shear cocycles.
result Properties of ρ\rho-invariant pleated surfaces, including embeddedness, acausality, and hyperbolic structure.

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.

Optimal insurance policy for exponential utility maximization with convex premium calculation.

problem Maximizing terminal wealth utility with exponential utility function and convex premium formula.
method Necessary condition for optimal indemnity, numerical algorithm to compute it, convergence proof.
result Numerical algorithm converges to unique optimal indemnity.

Stochastic AUC maximization has garnered an increasing interest due to better fit to imbalanced data classification. However, existing works are limited to stochastic AUC maximization with a linear predictive model, which restricts its predictive power when dealing with extremely complex data. In this paper, we conside…

2019-08-28abs ↗pdf ↗

Estimate relaxation times in nonextensive systems using gradient flow for Tsallis entropy maximization.

problem Estimating relaxation times in financial market dynamics.
method Developing a method using EGF for maximizing Tsallis entropy.
result Longer relaxation times for nonextensive systems compared to Shannon entropy.

Reinforcement learning (RL) methods learn optimal decisions in the presence of a stationary environment. However, the stationary assumption on the environment is very restrictive. In many real world problems like traffic signal control, robotic applications, one often encounters situations with non-stationary environme…

2019-05-10abs ↗pdf ↗

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ε1/e-ε approximation ratio with O(nε2logε1)O(nε^{-2}\log ε^{-1}) value oracle queries.

Develops a Bayesian framework for portfolio choice with a new posterior distribution.

problem Estimation risk in parametric portfolio policies.
method Generalized Bayesian framework with Gibbs posterior, utility maximization, and KNEEDLE algorithm.
result Optimal scaling parameter λλ controls the balance between prior and data.

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 π.

Theory is developed for linear-quadratic at infinity generating families for Legendrian knots in R^3. It is shown that the unknot with maximal Thurston--Bennequin invariant of -1 has a unique linear-quadratic at infinity generating family, up to fiber-preserving diffeomorphism and stabilization. From this, invariant ge…

2009-04-17abs ↗pdf ↗

In this paper, we propose scalable methods for maximizing a regularized submodular function f=gf = g - \ell expressed as the difference between a monotone submodular function gg and a modular function \ell. Indeed, submodularity is inherently related to the notions of diversity, coverage, and representativeness. In p…

2020-02-10abs ↗pdf ↗

Study feature representations induced by dependence between variables.

problem Learning feature representations from dependent random variables.
method Characterized sufficient and necessary conditions for dependence-induced representations, and provided a family of loss functions.
result Features learned from the family of loss functions can be expressed as the composition of a loss-dependent function and the maximal correlation function.

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 ↗

Adaptive cascade submodular maximization tackles sequential selection under uncertainty.

problem Maximizing expected utility from a set of items with unknown states and continuation probabilities.
method Proposed adaptive cascade submodular functions and a 0.12 approximation algorithm.
result Identified a class of functions (adaptive cascade submodular) that many practical applications satisfy.