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,742 papers · 148 categories

Trend · papers per month

19395877 · May 202619922001200920172026
48 results for Benders' decomposition

We introduce a novel mechanism to tighten the local polytope relaxation for MAP inference in Markov random fields with low state space variables. We consider a surjection of the variables to a set of hyper-variables and apply the local polytope relaxation over these hyper-variables. The state space of each individual h…

2018-05-13abs ↗pdf ↗

We propose a faster and more accurate method for learning classification trees.

problem Learning optimal binary classification trees is challenging and slow.
method We introduce a stronger MIP formulation and Benders' decomposition method.
result Our method is 50 times faster and improves out-of-sample performance.

In this paper, we study the dual representation for generalized multiple stopping problems, hence the pricing problem of general multiple exercise options. We derive a dual representation which allows for cashflows which are subject to volume constraints modeled by integer valued adapted processes and refraction period…

2011-12-12abs ↗pdf ↗

The free energy of a closed 3-manifold is a 2-parameter formal power series which encodes the perturbative Chern-Simons invariant (also known as the LMO invariant) of a closed 3-manifold with gauge group U(N) for arbitrary NN. We prove that the free energy of an arbitrary closed 3-manifold is uniformly Gevrey-1. As a …

2008-09-15abs ↗pdf ↗

Tree ensemble models such as random forests and boosted trees are among the most widely used and practically successful predictive models in applied machine learning and business analytics. Although such models have been used to make predictions based on exogenous, uncontrollable independent variables, they are increas…

2017-05-30abs ↗pdf ↗

In Bender and Dokuchaev (2013), we studied a control problem related to swing option pricing in a general non-Markovian setting. The main result there shows that the value process of this control problem can be uniquely characterized in terms of a first order backward SPDE and a pathwise differential inclusion. In the …

2014-02-26abs ↗pdf ↗

Paper proves convergence of Markovian iteration for FBSDEs with fully coupled drift and Z process.

problem Proving convergence of Markovian iteration for FBSDEs with fully coupled drift and Z process.
method Differentiation-based approach to handle Z process, uniformly controlling Lipschitz continuity of decoupling fields.
result Proves convergence of Markovian iteration method for FBSDEs with fully coupled drift and Z process.

The paper proposes and discusses semiorthogonal decompositions for moduli spaces of vector bundles.

problem Decompositions of moduli spaces of vector bundles with fixed determinant of odd degree.
method Semiorthogonal decompositions, Grothendieck ring of varieties, mirror symmetry, graph potentials, Fukaya category.
result Evidence for a conjectural semiorthogonal decomposition of moduli spaces of rank 2 bundles with odd determinant.

We combine aspects of the notions of finite decomposition complexity and asymptotic property C into a notion that we call finite APC-decomposition complexity. Any space with finite decomposition complexity has finite APC-decomposition complexity and any space with asymptotic property C has finite APC-decomposition comp…

2017-09-04abs ↗pdf ↗

Study shows OAT decomposition generates unexplained profit and loss, while SU decompositions depend on risk factor order.

problem Understanding profit and loss attribution in financial markets.
method Used financial market data from 2003 to 2022 to compare OAT, SU, and ASU decompositions.
result SU decompositions are sensitive to risk factor order and cannot identify all relevant risk factors.

A double pants decomposition of a 2-dimensional surface is a collection of two pants decomposition of this surface introduced in arXiv:1005.0073v2. There are two natural operations acting on double pants decompositions: flips and handle twists. It is shown in arXiv:1005.0073v2 that the groupoid generated by flips and h…

2010-08-22abs ↗pdf ↗

Let J1\mathcal{J}^1 be the real form of a complex simple Jordan algebra such that the automorphism group is F4(20)\mathrm{F}_{4(-20)}. By using some orbit types of F4(20)\mathrm{F}_{4(-20)} on J1\mathcal{J}^1, for F4(20)\mathrm{F}_{4(-20)}, explicitly, we give the Iwasawa decomposition, the Oshima--Sekiguchi's KεK_ε-Iwasawa decomp…

2011-09-05abs ↗pdf ↗

We study the topological types of pants decompositions of a surface by associating to any pants decomposition P,P, in a natural way its pants decomposition graph, Γ(P).Γ(P). This perspective provides a convenient way to analyze the maximum distance in the pants complex of any pants decomposition to a pants decomposition c…

2011-06-07abs ↗pdf ↗

New method uses random decompositions for high-dimensional Bayesian optimization.

problem Learning accurate decompositions for high-dimensional black-box functions.
method Data-independent random tree-based decomposition sampling.
result Random decomposition upper-confidence bound algorithm (RDUCB) yields significant empirical gains.

Derive new Euler-Ramanujan-type identities and infinite decompositions for zero mean curvature graphs in various spaces.

problem Derive new Euler-Ramanujan-type identities and infinite decompositions for zero mean curvature graphs in various spaces.
method Derive new Euler-Ramanujan-type identities and infinite decompositions for zero mean curvature graphs in various spaces.
result Derive new Euler-Ramanujan-type identities and infinite decompositions for zero mean curvature graphs in various spaces.

Decompositions on manifolds appear in various geometric structures. Necessary and sufficient conditions for quotient spaces of decompositions to be manifolds are widely characterized. We characterize necessary and sufficient conditions to be kk-manifolds (k=1,2)(k = 1, 2), which generalize characterizations in the codimens…

2017-03-15abs ↗pdf ↗

We give an example of two JSJ decompositions of a group that are not related by conjugation, conjugation of edge-inclusions, and slide moves. This answers the question of Rips and Sela stated in "Cyclic splittings of finitely presented groups and the canonical JSJ decomposition," Ann. of Math. 146 (1997), 53-109. On th…

2001-10-17abs ↗pdf ↗

We consider a union of two pants decompositions of the same orientable 2-dimensional surface of any genus g. Each pants decomposition corresponds to some handlebody bounded by this surface, so two pants decompositions correspond to a Heegaard splitting of a 3-manifold. We introduce a groupoid FT acting on double pants …

2010-05-01abs ↗pdf ↗

We present a novel nonnegative tensor decomposition method, called Legendre decomposition, which factorizes an input tensor into a multiplicative combination of parameters. Thanks to the well-developed theory of information geometry, the reconstructed tensor is unique and always minimizes the KL divergence from an inpu…

2018-02-13abs ↗pdf ↗

The aim of this paper is to provide some new tools to aid the study of decomposition complexity, a notion introduced by Guentner, Tessera and Yu. In this paper, three equivalent definitions for decomposition complexity are established. We prove that metric spaces with finite hyperbolic dimension have finite (weak) deco…

2015-09-22abs ↗pdf ↗

The paper defines and proves stabilization for 3-manifold decompositions with multibranched surface intersections.

problem Decomposing 3-manifolds with more than 3 handlebodies and multibranched surface intersections.
method Definition and proof of stabilization operations for these decompositions.
result Stable equivalence of handlebody decompositions with multibranched surface intersections.

To ensure interpretability of extracted sources in tensor decomposition, we introduce in this paper a dictionary-based tensor canonical polyadic decomposition which enforces one factor to belong exactly to a known dictionary. A new formulation of sparse coding is proposed which enables high dimensional tensors dictiona…

2017-04-03abs ↗pdf ↗

Analyzes canonical reductive decomposition of extrinsic homogeneous submanifolds.

problem Understanding the reductive decomposition of extrinsic homogeneous submanifolds.
method Examines Lie subgroups and reductive decompositions of homogeneous structures.
result Establishes a connection with the Ambrose-Singer theorem and homogeneous structures.

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful novel concept in algebraic geometry that generalizes the tensor CP decomposition…

2016-03-04abs ↗pdf ↗

The study examines how different interpolation methods affect the decomposition of life insurance surplus.

problem The impact of different interpolation methods on the decomposition of life insurance surplus.
method The study uses the IASU decomposition method to analyze the effects of different interpolation methods (Lee-Carter and linear) on the surplus decomposition.
result Lee-Carter and linear interpolation yield almost identical decompositions, while constant approximations result in different decompositions.

The paper uses tensor decompositions to improve neural network models for tree data.

problem Encoding structural knowledge from tree-structured data efficiently.
method Introduces new aggregation functions using Canonical and Tensor-Train decompositions.
result Proposed models outperform traditional methods on tree classification tasks.