Study on compact manifolds for exact G-Structures without additional constraints.
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.
Trend · papers per month
Non-exact Poisson structures found on toric varieties.
Study on Lie groups with exact G2 structures and closed eigenforms.
No exact G₂-structures on compact Lie group quotients.
Study exact Lie bialgebras from flat Lie groups, classifying them.
Paper explores limits of exact inference in structured prediction models.
The abstract discusses applications of Menke's JSJ decomposition to symplectic fillings of various 3-manifolds.
In this note we show that given an exact QS-manifold (a natural generalisation of an exact Poisson manifold) one can associate a family of odd Jacobi structures on the same underlying supermanifold.
Improved causal discovery methods for large graphs without strict assumptions.
Exact partitioning of high-order planted models achieved through convex optimization.
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…
Study integrability of specific geometric structures on odd Courant algebroids.
We study graph matching with correlated Gaussian features and find thresholds for exact recovery.
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…
Efficient algorithm for matching graphs with community structure.
Exact Gaussian Processes for massive datasets using non-stationary sparsity-discovering kernels.
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…
Study of free particle's geometry and its perturbations using complex projective structures.
We calculate the smooth structure set of , , for and . As a consequence we show that in general 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:…
Study quantization schemes on Kähler manifolds linking star products and BV quantizations.
We consider seven-dimensional unimodular Lie algebras admitting exact -structures, focusing our attention on those with vanishing third Betti number . We discuss some examples, both in the case when , and in the case when the Lie algebra is (…
We consider the inference of the structure of an undirected graphical model in an exact Bayesian framework. More specifically we aim at achieving the inference with close-form posteriors, avoiding any sampling step. This task would be intractable without any restriction on the considered graphs, so we limit our explora…
We show that if a contact open book on a -manifold () is induced by a Lefschetz fibration , then there is a one-to-one correspondence between positive stabilizations of and \emph{positive stabilizations} of . More precisely, any positive stabilization of is in…
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.
The paper proposes a method to learn the structure of continuous-action games with non-parametric utilities using a limited number of samples.
We study some properties of decomposable exact Lagrangian cobordisms between Legendrian links in with the standard contact structure. In particular, for any decomposable exact Lagrangian filling of a Legendrian link , we may obtain a normal ruling of associated with . We prove that the asso…
Fairness constraints improve exact recovery in structured prediction models.
Exact learning of tree-structured models with side info and noise.
We give examples of contact structures which admit exact symplectic fillings, but no Stein fillings, answering a question of Ghiggini.
Defines new structures on Courant algebroids, focusing on B_n types.
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…
A 2-manifold's group structure is deduced from orbit configuration spaces.
Bayesian structure learning is the NP-hard problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computational worst-case complexity of exact Bayesian structure learning under graph theoretic restrictions on the super-structure. The super-structure …
The paper constructs Levi flat structures using structure sheaves and differential complexes.
Develops integrators for contact Hamiltonian systems preserving geometric structure.
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,…
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 …
Hierarchical clustering is a fundamental task often used to discover meaningful structures in data, such as phylogenetic trees, taxonomies of concepts, subtypes of cancer, and cascades of particle decays in particle physics. Typically approximate algorithms are used for inference due to the combinatorial number of poss…
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…
In work the internal structure of de Rham cohomology is considered. As examples the phase flows in admitting the Nambu Poisson structure are studied.
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…
An introduction to the applications of algebraic surgery to the structure theory of high-dimensional topological manifolds.
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…
Finite resources limit false discovery rate control in structured hypothesis spaces.
Starting from a so-called flat exact semisimple bihamiltonian structures of hydrodynamic type, we arrive at a Frobenius manifold structure and a tau structure for the associated principal hierarchy. We then classify the deformations of the principal hierarchy which possess tau structures.
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…
The paper studies mapping class groups of 3-manifolds fibered over surfaces.
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…