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

8172533 · May 202619922001200920172026
48 results for strict complementarity

Improved Frank-Wolfe algorithm for polytopes converges linearly with dimension dependence on optimal face.

problem Efficiently solving convex minimization problems over polytopes with linear rate.
method Revisiting Frank-Wolfe algorithm with strict complementarity assumption and away-steps.
result Linear convergence rate independent of polytope dimension for optimal face.

New tensor recovery method improves efficiency under strict complementarity.

problem Efficiently recovering low-rank tensors using tensor nuclear norm.
method Developed strict complementarity condition for tensor nuclear norm ball and applied to gradient methods.
result Standard gradient methods achieve linear convergence and nearly linear runtime under strict complementarity.

In this paper, we show that the bundle method can be applied to solve semidefinite programming problems with a low rank solution without ever constructing a full matrix. To accomplish this, we use recent results from randomly sketching matrix optimization problems and from the analysis of bundle methods. Under strong d…

2019-11-11abs ↗pdf ↗

Geometric programming approach for traffic equilibrium problems.

problem Optimizing traffic equilibrium in transportation systems.
method Finslerian dynamical model for nonlinear complementarity problems.
result Effective solution for various equilibrium problems in transportation.

Study efficient numerical methods for American basket options.

problem Valuation of American basket options.
method Partial differential complementarity problems (PDCPs) and efficient discretization.
result Approximations of American basket options are close and converge favourably.

In a previous paper the second author showed that if MM is a pseudomanifold with complementarity other than the 6-vertex real projective plane and the 9-vertex complex projective plane, then MM must have dimension 6\geq 6, and - in case of equality - MM must have exactly 12 vertices. In this paper we prove that suc…

2004-04-12abs ↗pdf ↗

Improved Frank-Wolfe algorithm for constrained convex optimization with nearest extreme point oracle.

problem Constrained smooth convex minimization with limited linear optimization oracle access.
method Frank-Wolfe algorithm with nearest extreme point oracle.
result Improved complexity bounds for specific feasible sets, including linear convergence for 0ext10 ext{--}1 polytopes.

The paper proposes an efficient algorithm for solving Schatten-pp quasi-norm problems.

problem Finding low-rank solutions of linear inverse problems with Schatten-pp quasi-norm regularization.
method Dynamic proximal gradient algorithm using Cayley transformation and adaptive step size selection.
result The algorithm converges to a stationary point of the objective function under mild assumptions.

Kurdyka-Lojasiewicz (KL) exponent plays an important role in estimating the convergence rate of many contemporary first-order methods. In particular, a KL exponent of 12\frac12 for a suitable potential function is related to local linear convergence. Nevertheless, KL exponent is in general extremely hard to estimate. I…

2019-02-10abs ↗pdf ↗

Study explores optimal strategies in games with multiple players and mean-field interactions.

problem Optimal strategies in games with multiple players and mean-field interactions.
method Exploration of three different notions of optimality, including mean-field control solution, mean-field coarse correlated equilibria, and mean-field Nash equilibria.
result Approximation of cooperative and competitive equilibria in large NN-player games by mean-field control and mean-field equilibria.

Low rank matrix recovery problems appear widely in statistics, combinatorics, and imaging. One celebrated method for solving these problems is to formulate and solve a semidefinite program (SDP). It is often known that the exact solution to the SDP with perfect data recovers the solution to the original low rank matrix…

2020-02-25abs ↗pdf ↗

New method solves nonsmooth low-rank matrix optimization problems efficiently.

problem Nonsmooth and low-rank matrix optimization problems in statistics and machine learning.
method Low-rank Extragradient Method with warm-start initialization.
result The extragradient method converges to an optimal solution with rate O(1/t)O(1/t) and requires only two low-rank SVDs per iteration.

Efficiently implements MEG for low-rank matrix optimization problems.

problem Optimization over spectrahedron with low-rank matrices.
method Matrix Exponentiated Gradient (MEG) method with efficient implementations.
result Methods converge from a warm-start initialization with similar rates to full-SVD-based counterparts.

Sparse attention model reduces long-context inference time with exponential accuracy guarantees.

problem Efficiently processing long-context queries in large language models.
method Formalizes attention as a projection onto key vectors, analyzes entropic relaxation, and introduces Vashista Sparse Attention.
result Sparse attention concentrates on a constant-size active face, leading to exponential decay of inactive tokens' mass and linear scaling of active face error.

This paper studies an environment of simultaneous, separate, first-price auctions for complementary goods. Agents observe private values of each good before making bids, and the complementarity between goods is explicitly incorporated in their utility. For simplicity, a model is presented with two first-price auctions …

2013-12-10abs ↗pdf ↗

In this paper a simple, effective adaptation of Alternating Direction Implicit (ADI) time discretization schemes is proposed for the numerical pricing of American-style options under the Heston model via a partial differential complementarity problem. The stability and convergence of the new methods are extensively inv…

2013-08-31abs ↗pdf ↗

Bundling, the practice of jointly selling two or more products at a discount, is a widely used strategy in industry and a well examined concept in academia. Historically, the focus has been on theoretical studies in the context of monopolistic firms and assumed product relationships, e.g., complementarity in usage. We …

2020-01-31abs ↗pdf ↗

We study strict local martingales via h-transforms, a method which first appeared in Delbaen-Schachermayer. We show that strict local martingales arise whenever there is a consistent family of change of measures where the two measures are not equivalent to one another. Several old and new strict local martingales are i…

2007-11-07abs ↗pdf ↗

A new algorithm solves the metric nearness problem efficiently.

problem Finding the nearest distance matrix that satisfies triangle inequalities.
method Delayed constraint generation with semismooth Newton based proximal augmented Lagrangian method (PALM).
result Solves problems with up to 10^8 variables and 10^13 constraints efficiently.

Study complex hyperbolic lattices and their relation to strict hyperbolization.

problem Understanding the relationship between complex hyperbolic lattices and strict hyperbolization.
method Analyzing the fundamental groups of complex hyperbolic manifolds and spaces arising from strict hyperbolization.
result Uniform lattices in PU(n,1) cannot be fundamental groups of Charney-Davis strict hyperbolizations when n ≥ 2.

This paper deals with the numerical approximation of American-style option values governed by partial differential complementarity problems. For a variety of one- and two-asset American options we investigate by ample numerical experiments the temporal convergence behaviour of three modern splitting methods: the explic…

2016-10-30abs ↗pdf ↗

In this work we present a review of the state of the art of information theoretic feature selection methods. The concepts of feature relevance, redundance and complementarity (synergy) are clearly defined, as well as Markov blanket. The problem of optimal feature selection is defined. A unifying theoretical framework i…

2015-09-24abs ↗pdf ↗

We introduce a geometrically transparent strict saddle property for nonsmooth functions. This property guarantees that simple proximal algorithms on weakly convex problems converge only to local minimizers, when randomly initialized. We argue that the strict saddle property may be a realistic assumption in applications…

2019-12-16abs ↗pdf ↗

A new method for analyzing product competition using low-dimensional embeddings.

problem Computational challenges in studying product-level competition for millions of products.
method Product2Vec, a method based on representation learning algorithm Word2Vec.
result The method produces more accurate demand forecasts and price elasticities compared to state-of-the-art models.

We revisit the landscape of the simple matrix factorization problem. For low-rank matrix factorization, prior work has shown that there exist infinitely many critical points all of which are either global minima or strict saddles. At a strict saddle the minimum eigenvalue of the Hessian is negative. Of interest is whet…

2020-02-27abs ↗pdf ↗

We present simple new examples of pure-jump strict local martingales. The examples are constructed as exponentials of self-exciting affine Markov processes. We characterize the strict local martingale property of these processes by an integral criterion and by non-uniqueness of an associated ordinary differential equat…

2014-05-12abs ↗pdf ↗

Proves strict inequality for minimizers of Willmore energy under isoperimetric constraints.

problem Minimizing the Willmore energy under isoperimetric constraints.
method Connected sum approach, building on previous work by Keller-Mondino-Rivière.
result Existence of minimizers for the isoperimetric constrained Willmore problem in every genus.

New methods help escape strict saddle points in nonsmooth optimization.

problem Escaping strict saddle points in nonsmooth optimization.
method An inexact stochastically perturbed gradient method applied to the Moreau envelope.
result A variety of algorithms for nonsmooth optimization can efficiently escape strict saddle points of the Moreau envelope.

Let X be a norm curve in the SL(2,C)-character variety of a knot exterior M. Let t = || b || / || a || be the ratio of the Culler-Shalen norms of two distinct non-zero classes a, b in H_1(\partial M, Z). We demonstrate that either X has exactly two associated strict boundary slopes \pm t, or else there are strict bound…

2002-11-08abs ↗pdf ↗

We show the equivalence of the definitions of very strict CD(K,N)CD(K,N) -condition defined, on one hand, using (only) the entropy functionals, and on the other, the full displacement convexity class DCN\mathcal{DC}_N. In particular, we show that assuming the convexity inequalities for the critical exponent implies it for al…

2019-06-18abs ↗pdf ↗

We consider implied volatilities in asset pricing models, where the discounted underlying is a strict local martingale under the pricing measure. Our main result gives an asymptotic expansion of the right wing of the implied volatility smile and shows that the strict local martingale property can be determined from thi…

2015-08-18abs ↗pdf ↗