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

Trend · papers per month

241481722962 · Jun 202019922001200920172026
48 results for adapted complex structure

This study explores complex structures on Lie algebras from graph perspectives.

problem Existence and characterization of complex structures on 2-step nilpotent Lie algebras.
method Introducing adapted complex structures and analyzing integrability conditions.
result Characterization of graphs that admit abelian adapted complex structures and unique invariant subgraphs.

The paper studies hyperkähler structures and adapted complex structures using the Monge-Ampère equation.

problem Finding hyperkähler structures and adapted complex structures in tangent bundles.
method Analyzing the asymptotic expansion of the Monge-Ampère equation and using gauge transformations.
result Explicit computation of 4th order terms in the asymptotic expansion and equivalence to gauge transformations.

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.

Let M be a real analytic Riemannian manifold. An adapted complex structure on TMTM is a complex structure on a neighborhood of the zero section such that the leaves of the Riemann foliation are complex submanifolds. This structure is called entire if it may be extended to the whole of TMTM. We prove here that the only …

2015-10-12abs ↗pdf ↗

Let Ξ\,Ξ\, be the crown domain associated with a non-compact irreducible hermitian symmetric space G/K\,G/K. We give an explicit description of the unique G\,G-invariant adapted hyper-Kähler structure on Ξ\,Ξ, \ i.\,e. \ compatible with the adapted complex structure Jad\,J_{ad}\, and with the G\,G-invariant Kähle…

2017-11-05abs ↗pdf ↗

In this paper, we give a new construction of the adapted complex structure on a neighborhood of the zero section in the tangent bundle of a compact, real-analytic Riemannian manifold. Motivated by the "complexifier" approach of T. Thiemann as well as certain formulas of V. Guillemin and M. Stenzel, we obtain the polari…

2008-11-19abs ↗pdf ↗

We define and study complex structures and generalizations on spaces consisting of geodesics or harmonic maps that are compatible with the symmetries of these spaces. The main results are about existence and uniqueness of such structures.

2019-01-10abs ↗pdf ↗

A characterization of maximal domains of existence of adapted complex structures for Riemannian homogeneous manifolds under certain extensibility assumptions on their geodesic flow is given. This is applied to generalized Heisenberg groups and naturally reductive Riemannian homogeneous spaces. As an application it is s…

2002-06-07abs ↗pdf ↗

The paper explores linear generalised complex structures over vector bundles.

problem Understanding holomorphic vector bundles in a generalized geometry context.
method Adapted linear splitting and equivalence to C\mathbb C-multiplication and C\mathbb C-Lie algebroid structure.
result Generalised complex Lie algebroids are expressed as complex conjugated Lie bialgebroids.

We classify complex surfaces (M,J)(M,\,J) admitting Engel structures D\mathcal{D} which are complex line bundles. Namely we prove that this happens if and only if (M,J)(M,\,J) has trivial Chern classes. We construct examples of such Engel structures by adapting a construction due to Geiges. We also study associated Engel de…

2019-06-28abs ↗pdf ↗

Harmonic almost complex structures on specific Lie groups and solvmanifolds identified.

problem Characterizing harmonic almost complex structures on almost abelian Lie groups and solvmanifolds.
method Adapted Gray-Hervella classification to almost abelian Lie groups, characterized harmonic structures.
result Examples of harmonic almost complex structures in different Gray-Hervella classes on compact almost abelian solvmanifolds.

Enhances ocean floor mapping with adaptive uncertainty estimates.

problem Inaccurate bathymetric data for precise ocean modeling.
method Block-based conformal prediction with VQ-VAE architecture.
result Significant improvements in reconstruction quality and uncertainty estimation reliability.

The aim of this article is to use generalized complex structures in order to extend the definition of twistor spaces given by Penrose. We will adapt the integrability result of Atiyah, Hitchin and Singer. We will deduce new correspondences betwenn differential geometry and (generalized) complex geometry. In the last se…

2012-09-26abs ↗pdf ↗

FVI method calculates bicausal OT with neural networks, outperforming other methods.

problem Computing bicausal optimal transport with adapted coupling structures.
method FVI method using multilayer neural networks to approximate value functions.
result FVI method outperforms linear programming and Sinkhorn methods in scalability.

A generalized complex structure is called stable if its defining anticanonical section vanishes transversally, on a codimension-two submanifold. Alternatively, it is a zero elliptic residue symplectic structure in the elliptic tangent bundle associated to this submanifold. We develop Gompf-Thurston symplectic technique…

2017-03-10abs ↗pdf ↗

Improved optimal regularity for harmonic almost complex structures.

problem Establishing optimal regularity for harmonic almost complex structures.
method Quantitative stratification method and rectifiability of singular strata.
result Optimal regularity theory for energy minimizing harmonic almost complex structures.

A novel unsupervised domain adaptation method using hierarchical optimal transport.

problem Unsupervised domain adaptation between source and target domains.
method Hierarchical optimal transport, leveraging class labels for structure formation in the source domain and learning probability measures in the target domain.
result The proposed HOT-DA method outperforms state-of-the-art approaches on various datasets.

Shallow diffusion models learn hidden low-dimensional structures effectively.

problem Learning from high-dimensional signals like images and video.
method Analysis of shallow diffusion models over the Barron space of single layer neural networks.
result Shallow diffusion models can adapt to simple low-dimensional structures, overcoming the curse of dimensionality.

A beautiful solution to the problem of isometric immersions in Rn\mathbb{R}^n using spinors was found by Bayard, Lawn and Roth. However to use spinors one must assume that the manifold carries a $\mbox{Spin}$-structure and, especially for complex manifolds where is more natural to consider $\mbox{Spin}^{\mathbb{C}}$-st…

2017-09-04abs ↗pdf ↗

Paper simplifies complex AI exploration by predicting future rewards.

problem Training machines to optimally gather complex information.
method Developed a denser reward structure using cross-value to decouple exploration and exploitation.
result Demonstrated successful learning of challenging tasks without shaping or bonuses.

Optimal CATE estimation with structured contrast functions using KRR.

problem Estimating CATEs with complex response functions in RKHS.
method Unified two-stage kernel ridge regression method for structured contrast functions.
result Minimax rates governed by contrast function complexity, enabling adaptation.

We introduce interactive structure discovery, a generic framework that encompasses many interactive learning settings, including active learning, top-k item identification, interactive drug discovery, and others. We adapt a recently developed active learning algorithm of Tosh and Dasgupta (2017) for interactive structu…

2019-06-05abs ↗pdf ↗

The Serre construction of rank two holomorphic bundles with a section is adapted to construct generalized holomorphic bundles on a generalized complex 4-manifold from the data of a set of points on an elliptic curve. The motivation is the special case of rank two Poisson modules on a complex surface with a holomorphic …

2009-05-20abs ↗pdf ↗

The agent-based model of stock price dynamics on a directed evolving complex network is suggested and studied by direct simulation. The stationary regime is maintained as a result of the balance between the extremal dynamics, adaptivity of strategic variables and reconnection rules. The inherent structure of node agent…

2007-01-13abs ↗pdf ↗

DIVA generates diverse tasks for complex simulators, enabling adaptive agent training.

problem Lack of diverse training data for complex, open-ended simulators.
method Evolutionary approach using domain randomization and procedural generation.
result Successfully trains adaptive agent behavior in complex simulators.

Data-driven method for error estimation without needing class complexity.

problem Constructing confidence intervals for a class of estimates.
method Data-driven approach to derive high-probability upper bounds on maximum error.
result Method naturally adapts to unknown correlation structures and works for finite and infinite classes.

SASE improves attributed graph clustering for large graphs with linear time and space complexity.

problem Challenges in clustering large attributed graphs due to high computational and memory costs.
method SASE combines node features smoothing, scalable spectral clustering, and adaptive order selection.
result SASE achieves a 6.9% improvement in ACC and a 5.87x speedup on the ArXiv dataset.

We give necessary and sufficient conditions for the real distributions defined by a metallic pseudo-Riemannian structure to be integrable and geodesically invariant, in terms of associated tensor fields to the metallic structures and of adapted connections. In the integrable case, we prove a Chen-type inequality for th…

2019-03-10abs ↗pdf ↗

New method uses limited labeled data and multiple starts to adapt models across domains.

problem Accurate predictions in target domain with few labeled data.
method Fine-tuning from multiple adaptive starts, extending UDA methods.
result Minimax-optimal target performance with limited labeled target data.

SPARTAN learns sparse interaction graphs between objects in scenes.

problem Capturing structured interactions between entities in complex settings remains challenging.
method SPARTAN is a Transformer-based world model that learns sparse, context-dependent interaction graphs through sparsity regularization on attention patterns.
result SPARTAN achieves significantly improved few-shot adaptation to dynamics changes and robustness against distractors.

Over the last decade, both the neural network and kernel adaptive filter have successfully been used for nonlinear signal processing. However, they suffer from high computational cost caused by their complex/growing network structures. In this paper, we propose two random Euler filters for complex-valued nonlinear filt…

2018-01-02abs ↗pdf ↗

Adaptive algorithm improves nonlinear data assimilation for non-Gaussian systems.

problem Challenges of non-Gaussian statistics in data assimilation.
method Triangular measure transport with P-spline basis functions and an information criterion.
result Automatic selection of parsimonious parametrization for efficient adaptation.

We analyze the computational limits of LoRA for transformer models using fine-grained complexity theory.

problem Computational efficiency of LoRA fine-tuning for transformer models.
method Fine-grained complexity theory, identifying phase transitions, almost linear algorithms.
result Existence of almost linear algorithms for LoRA adaptation based on specific norms.

PrAda-GAN improves synthetic data generation under differential privacy.

problem Generating synthetic data under differential privacy with marginal-based methods.
method Sequential generator architecture integrating GAN and marginal-based approaches, with adaptive regularization of Bayes network structure.
result PrAda-GAN outperforms existing methods in privacy-utility trade-off on synthetic and real-world datasets.

We study existence of complex structures on semidirect products $\g \oplus_ρ \v$ where $\g$ is a real Lie algebra and ρρ is a representation of $\g$ on $\v$. Our first examples, the Euclidean algebra $\e(3)$ and the Poincaré algebra $ \e(2,1)$, carry complex structures obtained by deformation of a regular complex stru…

2003-07-29abs ↗pdf ↗