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

68136204272 · Jun 202019922001200920172026
48 results for Analog Domain

Novel algorithm for privacy-preserving distributed learning in analog domain.

problem Privacy-preserving distributed learning over analog data.
method Proposes a novel algorithm for analog data, leveraging real/complex number representation and information-theoretic security metrics.
result Demonstrates a fundamental trade-off between privacy and accuracy in analog domain distributed learning.

SCL discovers compositional structures in analogical reasoning tasks.

problem Discovering compositional structures in analogical reasoning tasks like Raven's Progressive Matrices.
method Proposes Scattering Compositional Learner (SCL) that composes neural networks in sequence.
result Achieves state-of-the-art performance on RPM datasets with significant improvements.

There is an analogy between machine learning systems and economic entities in that they are both adaptive, and their behaviour is specified in a more-or-less explicit way. It appears that the area of AI that is most analogous to the behaviour of economic entities is that of morally good decision-making, but it is an op…

2019-12-29abs ↗pdf ↗

We study the curvature flow of planar nonconvex lens-shaped domains, considered as special symmetric networks with two triple junctions. We show that the evolving domain becomes convex in finite time; then it shrinks homothetically to a point. Our theorem is the analog of the result of Grayson for curvature flow of clo…

2009-05-31abs ↗pdf ↗

Building on a specific formalization of analogical relationships of the form "A relates to B as C relates to D", we establish a connection between two important subfields of artificial intelligence, namely analogical reasoning and kernel-based machine learning. More specifically, we show that so-called analogical propo…

2019-01-07abs ↗pdf ↗

Paper formalizes analogy between data sets and models using Hoare logic.

problem Lack of formal criteria for transferring machine learning models between data domains.
method Formalization of analogy using first-order logic and Hoare logic, rigorous theorem proving.
result Rigorous formalization of analogy in knowledge transfer between machine learning models.

Study Kähler-Ricci solitons on bounded domains, proving they are Kähler-Einstein.

problem Characterize Kähler-Ricci solitons on bounded pseudoconvex domains.
method Prove solitons are Kähler-Einstein under suitable assumptions, using Huang and Xiao's resolution of Cheng's conjecture.
result Kähler-Ricci solitons on bounded pseudoconvex domains are Kähler-Einstein.

Establishes a lower bound for Kähler-Einstein distance on certain domains.

problem Finding a lower bound for Kähler-Einstein distance on specific types of domains.
method Proves an analog of the Hopf lemma for Riemannian manifolds with Ricci curvature bounded from below.
result Establishes a lower bound for the Kähler-Einstein distance on pseudoconvex domains with positive hyperconvexity index.

In this paper, it is shown that a Fuchsian group, acting on the upper half-plane model for H2\mathbb{H}^2, admits a Ford domain which is also a Dirichlet domain, for some center, if and only if it is an index 2 subgroup of a reflection group. This is used to exhibit an example of a maximal arithmetic hyperbolic reflect…

2009-11-25abs ↗pdf ↗

The special linear groups, the mapping class groups of surfaces, the outer autormorphism groups of free groups appear in numerous domains. Their analogies, developped in particular in K. Vogtmann's work, have been written about a lot. In this report, we concentrate on the contractible spaces on which these groups act i…

2011-10-02abs ↗pdf ↗

Our main result is that if a generic convex domain in Rn\R^n collapses to a domain in Rn1\R^{n-1}, then the difference between the first two Dirichlet eigenvalues of the Euclidean Laplacian, known as the fundamental gap, diverges. The boundary of the domain need not be smooth, merely Lipschitz continuous. To motivate th…

2008-10-27abs ↗pdf ↗

In this paper we consider discrete groups in PGLd(R){\rm PGL}_d(\mathbb{R}) acting convex co-compactly on a properly convex domain in real projective space. For such groups, we establish necessary and sufficient conditions for the group to be relatively hyperbolic in terms of the geometry of the convex domain. This answers …

2019-10-20abs ↗pdf ↗

A scalable deep learning framework accelerates training of large neural networks for solving 3D Poisson equations.

problem Training large-scale neural networks for solving complex PDEs efficiently.
method Combines multigrid techniques with distributed deep learning to accelerate training.
result Solves 3D Poisson equations up to 512x512x512 resolution efficiently.

The study sets lower bounds for eigenvalue sums of Laplacian on bounded domains and spheres.

problem Establishing lower bounds for eigenvalue sums of the Laplacian.
method Extending known results on eigenvalues of Laplacian for bounded domains, spheres, and surfaces.
result Improved lower bounds for eigenvalue sums, connecting to conjectures and extending known results.

Proposes BN layers for neural networks on complex domains, improving training stability and accuracy.

problem Training stability and accuracy issues in neural networks on complex domains.
method Developed Riemannian batch normalization (BN) layers with connections to existing layers.
result Demonstrated improved performance on radar clutter classification, node classification, and action recognition.

In this paper, we provide a new neural-network based perspective on multi-task learning (MTL) and multi-domain learning (MDL). By introducing the concept of a semantic descriptor, this framework unifies MDL and MTL as well as encompassing various classic and recent MTL/MDL algorithms by interpreting them as different w…

2014-12-23abs ↗pdf ↗

In this paper we prove that a flat free-boundary minimal nn-disk, n3n\geq3, in the unit Euclidean ball Bn+1B^{n+1} is the unique compact free boundary minimal hypersurface in the unit Euclidean ball which the squared norm of the second fundamental form is less than either n24\frac{n^2}{4} or (n2)24x2\frac{(n-2)^2}{4|x|^2}. Mor…

2018-07-27abs ↗pdf ↗

Study Gromov hyperbolic domains in Minkowski space, proving equivalence to boundary properties.

problem Investigate Gromov hyperbolic domains in Minkowski space.
method Explicit comparisons between metrics, dynamical arguments, and quasi-hyperbolic metric.
result Gromov hyperbolicity of convex, future complete domains is equivalent to stable acausality of the boundary.

Negative curvature restricts the gap between the first and second eigenvalues of convex domains.

problem The fundamental gap of convex domains is limited by negative curvature.
method Adapted from Bourni et. al. (2022) for Riemannian manifolds with negative sectional curvature.
result The product of the fundamental gap and the square of the diameter can be arbitrarily small in domains with negative curvature.

Few-shot visual reasoning model learns analogical relationships from small data.

problem Training deep models on few samples for visual reasoning tasks.
method Meta-analogical contrastive learning to enforce structural similarity between training and test samples.
result Method outperforms state-of-the-art on RAVEN dataset with scarce training data.

We study actions of discrete subgroups ΓΓ of semi-simple Lie groups GG on associated oriented flag manifolds. These are quotients G/PG/P, where the subgroup PP lies between a parabolic subgroup and its identity component. For Anosov subgroups ΓGΓ\subset G, we identify domains in oriented flag manifolds by removing a …

2018-06-12abs ↗pdf ↗

We study the problem of formally verifying the robustness to adversarial examples of support vector machines (SVMs), a major machine learning model for classification and regression tasks. Following a recent stream of works on formal robustness verification of (deep) neural networks, our approach relies on a sound abst…

2019-04-26abs ↗pdf ↗

Investigates properties of a pseudometric on domains in Euclidean space, linking it to hyperbolic geometry.

problem Defines and analyzes a pseudometric on domains in Rn\mathbb R^n to understand their hyperbolic properties.
method Introduces a pseudometric based on conformal harmonic discs and studies its properties and conditions for hyperbolicity.
result Characterizes domains as hyperbolic based on their geometric properties and provides sufficient conditions for hyperbolicity.

We study the problem of inviscid slightly compressible fluids in a bounded domain. We find a unique solution to the initial-boundary value problem and show that it is near the analogous solution for an incompressible fluid provided the initial conditions for the two problems are close. In particular, the divergence of …

2013-09-02abs ↗pdf ↗

The Einstein equations (EE) are certain conditions on the Riemann tensor on the real Minkowski space M. In the twistor picture, after complexification and compactification M becomes the Grassmannian Gr24Gr_{2}^{4} of 2-dimensional subspaces in the 4-dimensional complex one. Here we answer for which of the classical domai…

2003-06-12abs ↗pdf ↗

Study of knotted defects in smectic liquid crystals using topological knot theory.

problem Understanding the topological structure of knotted defects in smectic liquid crystals.
method Investigation of screw and edge dislocations, focusing on their radial surface structure and knot fibration.
result Established a connection between smectic defects and knot theory, revealing the topological knotting of defects.

In this note, we investigate upper bounds of the Neumann eigenvalue problem for the Laplacian of a bounded domain (with smooth boundary) in a given complete (not compact a priori) Riemannian manifold with Ricci bounded below . For this, we use test functions for the Rayleigh quotient subordinated to a family of open se…

2008-02-20abs ↗pdf ↗

The expression (-1/u) times the Hessian of u transforms as a symmetric (0,2) tensor under projective coordinate transformations, so long as u transforms as a section of a certain line bundle. On a locally projectively flat manifold M, the section u can be regarded as a metric potential analogous to the local potential …

2001-08-30abs ↗pdf ↗

We are interested in comparing properties of symplectic mapping class groups of symplectic manifolds of dimension four or higher with properties of classical mapping class groups of surfaces. For n2n \geq 2, consider a configuration of Lagrangian SnS^ns in a Weinstein domain M2nM^{2n}. If it is analogous, in some sense …

2017-11-27abs ↗pdf ↗

The paper resolves a problem about metric inequivalence and characterizes proper holomorphic maps.

problem Metric inequivalence and characterization of proper holomorphic maps.
method Explicit characterization of proper holomorphic maps from a finitely-connected planar domain onto the unit disk.
result Characterization of proper holomorphic maps from a finitely-connected planar domain onto the unit disk.

As in the case of irreducible holomorphic symplectic manifolds, the period domain ComplCompl of compact complex tori of even dimension 2n2n contains twistor lines. These are special 22-spheres parametrizing complex tori whose complex structures arise from a given quaternionic structure. In analogy with the case of irredu…

2018-06-20abs ↗pdf ↗

The paper studies the First Order BSPDEs (Backward Stochastic Partial Differential Equations) suggested earlier for a case of multidimensional state domain with a boundary. These equations represent analogs of Hamilton-Jacobi-Bellman equations and allow to construct the value function for stochastic optimal control pro…

2016-03-22abs ↗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 ↗