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

141281422562 · May 202619922001200920172026
48 results for Exact Structures

Study on compact manifolds for exact G2_{2}-Structures without additional constraints.

problem Whether compact 7-manifolds support exact G2_{2}-Structures.
method Investigate exact G2_{2}-Structures on compact manifolds, considering relationships with other conditions.
result Initiate a study on exact G2_{2}-Structures on compact manifolds without additional constraints.

No exact G₂-structures on compact Lie group quotients.

problem Existence of exact G₂-structures on compact quotients of Lie groups.
method Analyzing compact quotients of seven-dimensional Lie groups by co-compact discrete subgroups.
result Compact quotients of seven-dimensional Lie groups by co-compact discrete subgroups do not admit exact G₂-structures induced by left-invariant ones.

Paper explores limits of exact inference in structured prediction models.

problem Exact recovery of true labels in graph-based structured prediction models.
method Analyzes necessary and sufficient conditions for exact recovery using maximum likelihood estimation.
result Derives tight conditions for exact recovery, revealing a gap with computationally tractable methods.

The abstract discusses applications of Menke's JSJ decomposition to symplectic fillings of various 3-manifolds.

problem Classifying symplectic fillings of contact 3-manifolds.
method Application of Menke's JSJ decomposition to families of contact 3-manifolds.
result Unique exact fillings for virtually overtwisted circle bundles over surfaces with genus > 1 and negative twisting number.

Exact partitioning of high-order planted models achieved through convex optimization.

problem Efficiently partitioning hypergraphs generated by high-order planted models.
method Solving a computationally efficient convex optimization problem with a tensor nuclear norm constraint.
result Exact recovery of true underlying cluster structures with high probability.

We construct an infinite-dimensional symplectic 2-groupoid as the integration of an exact Courant algebroid. We show that every integrable Dirac structure integrates to a "Lagrangian" sub-2-groupoid of this symplectic 2-groupoid. As a corollary, we recover a result of Bursztyn-Crainic-Weinstein-Zhu that every integrabl…

2013-10-24abs ↗pdf ↗

Study integrability of specific geometric structures on odd Courant algebroids.

problem Characterize integrability of B_n-generalized structures on odd exact Courant algebroids.
method Characterize integrability in terms of existence of adapted generalized connections.
result Describe affine spaces of adapted generalized connections for integrable structures.

We study graph matching with correlated Gaussian features and find thresholds for exact recovery.

problem Graph matching with correlated Gaussian features.
method Information-theoretic thresholds and conditions for exact and almost exact recovery.
result Contextual information introduces a richer structure, with thresholds for exact and almost exact recovery no longer coinciding.

We introduce symplectic Calabi-Yau caps to obtain new obstructions to exact fillings. In particular, it implies that any exact filling of the standard unit cotangent bundle of a hyperbolic surface has vanishing first Chern class and has the same integral homology and intersection form as its disk cotangent bundle. This…

2014-12-10abs ↗pdf ↗

Efficient algorithm for matching graphs with community structure.

problem Graph matching between correlated stochastic block models with constant correlation.
method Partition trees rooted from each vertex, comparing edge statistics to different communities.
result First low-order polynomial-time algorithm achieving exact matching with high probability in dense graphs.

Exact Gaussian Processes for massive datasets using non-stationary sparsity-discovering kernels.

problem High computational and storage costs for exact GPs in large datasets.
method Develop non-stationary kernels that allow the GP to discover sparse structure naturally.
result Exact Gaussian Processes scalable to over 5 million data points.

This work presents novel algorithms for learning Bayesian network structures with bounded treewidth. Both exact and approximate methods are developed. The exact method combines mixed-integer linear programming formulations for structure learning and treewidth computation. The approximate method consists in uniformly sa…

2014-06-05abs ↗pdf ↗

Study of free particle's geometry and its perturbations using complex projective structures.

problem Understanding the geometry of a free particle and its perturbations.
method Use of complex projective structures and quasiconformal geometry to study perturbations.
result Main results loosely modeled on algebraic transformation theory, foundational for geometric understanding of the exact WKB method.

We calculate the smooth structure set of Sp×SqS^p \times S^q, S(p,q)S(p, q), for p,q2p, q \geq 2 and p+q5p+q \geq 5. As a consequence we show that in general S(4j1,4k)S(4j-1, 4k) cannot admit a group structure such that the smooth surgery exact sequence is a long exact sequence of groups. We also show that the image of forgetful map $F:…

2009-04-08abs ↗pdf ↗

Study quantization schemes on Kähler manifolds linking star products and BV quantizations.

problem Quantization of structures on Kähler manifolds.
method Construct Fedosov's star products and Batalin-Vilkovisky (BV) quantizations.
result One-loop exactness of BV quantizations, leading to a cochain level formula.

We consider seven-dimensional unimodular Lie algebras g\mathfrak{g} admitting exact G2G_2-structures, focusing our attention on those with vanishing third Betti number b3(g)b_3(\mathfrak{g}). We discuss some examples, both in the case when b2(g)0b_2(\mathfrak{g})\neq0, and in the case when the Lie algebra g\mathfrak{g} is (…

2019-04-24abs ↗pdf ↗

We show that if a contact open book (Σ,h)(Σ,h) on a (2n+1)(2n+1)-manifold MM (n1n\geq1) is induced by a Lefschetz fibration π:WD2π:W \to D^2, then there is a one-to-one correspondence between positive stabilizations of (Σ,h)(Σ,h) and \emph{positive stabilizations} of ππ. More precisely, any positive stabilization of (Σ,h)(Σ,h) is in…

2011-12-02abs ↗pdf ↗

In this letter, I consider the issue of pricing risky debt by following Merton's approach. I generalize Merton's results to the case where the interest rate is modeled by the CIR term structure. Exact closed forms are provided for the risky debt's price.

1998-08-16abs ↗pdf ↗

The paper proposes a method to learn the structure of continuous-action games with non-parametric utilities using a limited number of samples.

problem Learning the exact structure of continuous-action games with non-parametric utility functions.
method An 1\ell_1 regularized method that encourages sparsity of the Fourier transform coefficients of the utility functions, accessed via a few Nash equilibria and their noisy utilities.
result The method recovers the exact structure of the utility functions and the game structure with provable theoretical guarantees.

We study some properties of decomposable exact Lagrangian cobordisms between Legendrian links in R3\mathbb{R}^3 with the standard contact structure. In particular, for any decomposable exact Lagrangian filling LL of a Legendrian link KK, we may obtain a normal ruling of KK associated with LL. We prove that the asso…

2015-12-26abs ↗pdf ↗

Fairness constraints improve exact recovery in structured prediction models.

problem Exact recovery of fair binary node labels from noisy observations.
method Analyzed Globerson et al. (2015) model with fairness constraints and improved exact recovery for graphs with poor expansion properties.
result Fairness constraints improve the probability of exact recovery from noisy observations.

Structured prediction can be thought of as a simultaneous prediction of multiple labels. This is often done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise and unary potentials. The above is naturally modeled with a graph, where edges and vertices are related to pairwise and…

2019-06-02abs ↗pdf ↗

A 2-manifold's group structure is deduced from orbit configuration spaces.

problem Understanding the fundamental groups of orbit configuration spaces.
method Relating the four-term exact sequence of orbifold pure braid groups to the fundamental groups of the orbit configuration spaces.
result Fundamental groups of orbit configuration spaces form a four-term exact sequence.

The paper constructs Levi flat structures using structure sheaves and differential complexes.

problem Global solvability and regularity of Levi flat structures.
method Employing formal integrability and differential complexes, the paper constructs a resolution for the structure sheaf.
result Global exactness and Sobolev regularity of the differential complex for Levi flat structures.

Develops integrators for contact Hamiltonian systems preserving geometric structure.

problem Creating integrators for dissipative systems with geometric structure.
method Structure-preserving splitting framework based on exact-contact subflows.
result Local universality of contact splitting integrators.

We show a connection between a surgery exact sequence in knot Floer homology and the sequence derived in [18]. As a consequence of this relationship we see that the exact sequence in [18] also works with coherent orientations and admits refinements with respect to spinc-structures. As an application of this discussion,…

2010-02-22abs ↗pdf ↗

Under certain integrability and geometric conditions, we prove division theorems for the exact sequences of holomorphic vector bundles and improve the results in the case of Koszul complex. By introducing a singular Hermitian structure on the trivial bundle, our results recover Skoda's division theorem for holomorphic …

2011-02-19abs ↗pdf ↗

This paper considers the problem of estimating the structure of multiple related directed acyclic graph (DAG) models. Building on recent developments in exact estimation of DAGs using integer linear programming (ILP), we present an ILP approach for joint estimation over multiple DAGs, that does not require that the ver…

2014-04-04abs ↗pdf ↗

We present a comprehensive framework for structured sparse coding and modeling extending the recent ideas of using learnable fast regressors to approximate exact sparse codes. For this purpose, we develop a novel block-coordinate proximal splitting method for the iterative solution of hierarchical sparse coding problem…

2012-06-18abs ↗pdf ↗

The theory of the last multipliers as solutions of the Liouville's transport equation, previously developed for vector fields, is extended here to general multivectors. Characterizations in terms of Witten and Marsden differentials are reobtained as well as the algebraic structure of the set of multivectors with a comm…

2007-07-02abs ↗pdf ↗

Finite resources limit false discovery rate control in structured hypothesis spaces.

problem Controlling false discovery rate in hypothesis testing with finite data and structured hypothesis spaces.
method Framework for exact FDR control and adaptive power maximization.
result Exact FDR control and adaptive power maximization.

We present new algorithms for learning Bayesian networks from data with missing values using a data augmentation approach. An exact Bayesian network learning algorithm is obtained by recasting the problem into a standard Bayesian network learning problem without missing data. To the best of our knowledge, this is the f…

2016-08-27abs ↗pdf ↗

Recently, there has been much interest in finding globally optimal Bayesian network structures. These techniques were developed for generative scores and can not be directly extended to discriminative scores, as desired for classification. In this paper, we propose an exact method for finding network structures maximiz…

2012-06-27abs ↗pdf ↗