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

63126189252 · Jun 202019922001200920172026
48 results for subdomain adaptation

TMDA aligns subdomain data distribution discrepancies across domains using manifold representations.

problem Transfer learning challenges due to domain divergence.
method TMDA uses low-dimensional manifolds to represent subdomains and aligns local data distribution discrepancies across domains using M3D.
result TMDA is a promising method for various transfer learning tasks.

In this note we show that on any compact subdomain of a Kähler manifold that admits sufficiently many global holomorphic functions, the products of harmonic functions form a complete set. This gives a positive answer to the linearized anisotropic Calderón problem on a class of complex manifolds that includes compact su…

2018-05-02abs ↗pdf ↗

We introduce a new class of unbounded model subdomains of C2\mathbb{C}^2 for the b\Box_b problem. Unlike previous finite type models, these domains need not be bounded by algebraic varieties. In this paper we obtain precise global estimates for the Carnot-Carathéodory metric induced on the boundary of such domains by …

2013-12-03abs ↗pdf ↗

Braided vector fields on spatial subdomains homeomorphic to the cylinder play a crucial role in applications such as solar and plasma physics, relativistic astrophysics, fluid and vortex dynamics, elasticity, and bio-elasticity. Often the vector field's topology -- the entanglement of its field lines -- is non-trivial,…

2019-09-17abs ↗pdf ↗

The recent advances in deep transfer learning reveal that adversarial learning can be embedded into deep networks to learn more transferable features to reduce the distribution discrepancy between two domains. Existing adversarial domain adaptation methods either learn a single domain discriminator to align the global …

2019-09-18abs ↗pdf ↗

Examines optimal risk sharing with realistic risk attitudes, finding risk seeking in certain subdomains.

problem Optimal risk sharing with empirically realistic risk attitudes.
method Allows for risk-seeking agents, generalizes expected utility, and uses counter-monotonic improvement theorem.
result First empirical results on optimal risk sharing with realistic risk attitudes.

A new method tackles Bayesian inverse problems with complex PDEs.

problem Bayesian inverse problems with expensive forward model evaluations and high-dimensional priors.
method Domain-decomposed variational auto-encoder Markov chain Monte Carlo (DD-VAE-MCMC) method.
result The method efficiently solves Bayesian inverse problems in parallel and low-dimensional latent spaces.

The current article studies certain problems related to complex cycles of holomorphic foliations with singularities in the complex plane. We focus on the case when polynomial differential one-form gives rise to a foliation by Riemann surfaces. In this setting, a complex cycle is defined as a nontrivial element of the f…

2010-05-11abs ↗pdf ↗

Study on holomorphic isometries between complex domains, revealing geometric properties.

problem Characterizing holomorphic isometries between bounded symmetric domains.
method Analyzing holomorphic isometries between complex unit ball and other bounded symmetric domains, using classical results for complex-analytic subvarieties of Stein manifolds.
result Images of holomorphic isometries have specific geometric properties, including intersections with affine-linear subspaces.

GAN-based semi-supervised learning improves classifier generalization.

problem Improving classifier performance with limited labeled data.
method Theoretical analysis of GAN-SSL, proving equivalence of discriminator optimization and supervised learning, and exploring conditions for perfect discriminator.
result GAN-SSL theoretically outputs a perfect discriminator on both labeled and unlabeled data.

We consider complex projective space P^{n} and a smooth closed curve gamma in P^{n}. Harvey and Lawson have defined the notion of the projective hull \hat{K} of a compact subset K in P^n. This concept is an analogue of the polynomial hull of compact subsets of C^{n}. In the present note we study the relation between th…

2008-07-23abs ↗pdf ↗

Local semi-supervised method improves brain tissue classification in child MRI.

problem Inaccurate detection of brain tissue classes due to intensity variations in early developing brains.
method Kernel Fisher Discriminant Analysis (KFDA) combined with SSIM for perceptual image quality assessment.
result Optimal brain partitioning into subdomains with different average intensity values and separating surfaces between brain parts.

A new method reduces high-dimensional parameter spaces for faster numerical tasks.

problem Efficiently reducing high-dimensional parameter spaces for numerical tasks.
method Local Active Subspaces (LAS) combining active subspaces with clustering techniques.
result Significant speed-up in numerical tasks through efficient dimension reduction.

Localized deformation of scalar curvature and mean curvature on manifolds.

problem Deforming scalar curvature and mean curvature on compact manifolds with boundary.
method Proving localized surjection of scalar curvature and mean curvature map, handling non-variational linearized problem.
result Localized deformations of scalar curvature and mean curvature on compact manifolds are possible.

Consider a convex domain B of space. We prove that there exist complete minimal surfaces which are properly immersed in B. We also demonstrate that if D and D' are convex domains with D bounded and the closure of D contained in D' then any minimal disk whose boundary lies in the boundary of D, can be approximated in an…

2004-05-26abs ↗pdf ↗

The twistor space of the sphere S^{2n} is an isotropic Grassmannian that fibers over S^{2n}. An orthogonal complex structure on a subdomain of S^{2n} (a complex structure compatible with the round metric) determines a section of this fibration with holomorphic image. In this paper, we use this correspondence to prove t…

2009-05-22abs ↗pdf ↗

The paper proves uniqueness of evolving graphs by mean curvature flow under specific conditions.

problem Proving uniqueness of entire graphs evolving by mean curvature flow.
method Analyzes graphs of locally Lipschitz functions and rotationally symmetric solutions, proving uniqueness under uniform lower bounds and proper graphs.
result Uniqueness of entire graphs evolving by mean curvature flow under specified conditions.

Study on static manifolds with boundary and rigidity of curvature.

problem Understanding the rigidity of scalar curvature and mean curvature on manifolds with boundary.
method Analyzing maps of scalar curvature in the interior and mean curvature on the boundary, discussing geometric properties of static manifolds.
result Classification and rigidity theorems for simple non-generic domains in space forms and Schwarzschild manifold.

In the current article we study complex cycles of higher multiplicity in a specific polynomial family of holomorphic foliations in the complex plane. The family in question is a perturbation of an exact polynomial one-form giving rise to a foliation by Riemann surfaces. In this setting, a complex cycle is defined as a …

2011-06-14abs ↗pdf ↗

We introduce here explicit integral formulas for linking, twisting, writhing and helicity on the 3-sphere and in hyperbolic 3-space. These formulas, like their prototypes in Euclidean 3-space, are geometric rather than just topological, in the sense that their integrands are invariant under orientation-preserving isome…

2004-06-14abs ↗pdf ↗

The Mondrian process represents an elegant and powerful approach for space partition modelling. However, as it restricts the partitions to be axis-aligned, its modelling flexibility is limited. In this work, we propose a self-consistent Binary Space Partitioning (BSP)-Tree process to generalize the Mondrian process. Th…

2019-03-22abs ↗pdf ↗

We study the local Szegö-Weinberger profile in a geodesic ball Bg(y0,r0)B_g(y_0,r_0) centered at a point y0y_0 in a Riemannian manifold $(\M,g)$. This profile is obtained by maximizing the first nontrivial Neumann eigenvalue μ2μ_2 of the Laplace-Beltrami Operator ΔgΔ_g on $\M$ among subdomains of Bg(y0,r0)B_g(y_0,r_0) with fixed vol…

2011-10-21abs ↗pdf ↗

The paper studies the smoothness of critical points of variational integrals on Hessian spaces.

problem The study focuses on the regularity of critical points of variational integrals defined on Hessian spaces.
method The approach involves solving a fourth order nonlinear equation and analyzing the Hessian of the critical points.
result Smooth critical points with bounded Hessian are shown to be smooth provided their Hessian has small BMO.

This research discovers model architecture and training dataset characteristics through strategic input probing.

problem Discovering model architecture and training dataset characteristics in black box models.
method Structured input probes and model outputs are used to train a deep classifier for image and text classification.
result The approach successfully distinguishes between different image and text datasets and architectures.

The paper sets geometric lower bounds for low Steklov eigenvalues on manifolds.

problem Finding geometric lower bounds for low Steklov eigenvalues on manifolds.
method Using trace inequalities relating Steklov eigenvalues to Neumann eigenvalues of subdomains containing boundary collars.
result Geometric lower bounds for low Steklov eigenvalues, complementing earlier results.

We consider sequences of metrics, gjg_j, on a Riemannian manifold, MM, which converge smoothly on compact sets away from a singular set SMS\subset M, to a metric, gg_\infty, on MSM\setminus S. We prove theorems which describe when Mj=(M,gj)M_j=(M, g_j) converge in the Gromov-Hausdorff sense to the metric completion, $(M_\in…

2012-02-04abs ↗pdf ↗

Object ranking or "learning to rank" is an important problem in the realm of preference learning. On the basis of training data in the form of a set of rankings of objects represented as feature vectors, the goal is to learn a ranking function that predicts a linear order of any new set of objects. In this paper, we pr…

2017-11-28abs ↗pdf ↗