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

Trend · papers per month

54108162216 · May 202619922001200920172026
48 results for composition operators

The paper defines functions that induce bounded composition operators on RKHSs with analytic positive definite functions.

problem Characterizing functions that induce bounded composition operators on RKHSs.
method Intrinsic properties of RKHSs and asymptotic properties of orthogonal polynomials.
result Only affine transforms can induce bounded composition operators in a large class of RKHSs.

New conditions for weighted composition operators in group homomorphisms.

problem Conditions for weighted composition operators in group homomorphisms.
method Range decreasing group homomorphisms.
result New insights into weighted composition operators and their algebraic structure.

Paper combines geometry and time-series analysis for spatiotemporal data.

problem Multivariate time-series data from multiple sensors.
method Combines manifold learning, Riemannian geometry, and spectral analysis.
result Proposes Riemannian multi-resolution analysis (RMRA) for dynamic mode extraction.

We study b-arc foliation change and exchange move of open book foliations which generalize the corresponding operations in braid foliation theory. We also define a bypass move as an analogue of Honda's bypass attachment operation. As applications, we study how open book foliations change under a stabilization of the op…

2013-09-17abs ↗pdf ↗

Paper generalizes paracomposition and change of variables for paradifferential operators.

problem Generalizing paracomposition and change of variables for paradifferential operators in low regularity settings.
method Drops diffeomorphism hypothesis, estimates in Sobolev and Zygmund spaces, discusses pull-back of pseudodifferential and paradifferential operators.
result Sharp estimates for composition in Sobolev and Zygmund spaces, change of variables in paradifferential operators.

We present a learning theory for the training of a linear system operator having an input compositional variable and propose a Bayesian inversion method for inferring the unknown variable from an output of a noisy linear system. We assume that we have partial or even no knowledge of the operator but have training data …

2018-06-29abs ↗pdf ↗

The paper studies tunnel and bridge numbers of composite genus 2 spatial graphs.

problem Understanding the tunnel and bridge numbers of composite genus 2 spatial graphs.
method Analyzes connected sum and trivalent vertex sum operations on genus 2 spatial graphs, proving bounds for tunnel and bridge numbers.
result Sharp bounds for the tunnel number of composite genus 2 spatial graphs, including lower bounds for bridge numbers.

A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a virtual string. In this paper we consider three operations on a virtual string …

2008-08-04abs ↗pdf ↗

We give a complete classification of intertwining operators (symmetry breaking operators) between spherical principal series representations of G=O(n+1,1) and G'=O(n,1). We construct three meromorphic families of the symmetry breaking operators, and find their distribution kernels and their residues at all poles explic…

2013-10-11abs ↗pdf ↗

Operator calculus for population-based optimization provides a unified framework for analyzing convergence of various methods.

problem Convergence analysis of population-based optimization methods
method Introduce an operator calculus for describing composite mean-field algorithms as compositions of elementary operators acting on probability measures.
result Establish a modular Lyapunov principle for certifying exponential decay of state-space Lyapunov function and search errors.

This paper studies neural network operators and their convergence properties.

problem Understanding the approximation and convergence of neural network operators.
method Proves density results, convergence estimates, and Voronovskaya-type theorems.
result Establishes quantitative convergence estimates and derives Voronovskaya-type theorems.

NeSS combines neural and symbolic approaches for better compositional generalization.

problem Lack of compositional generalization in deep learning models.
method NeSS uses a neural network to generate traces, executed by a symbolic stack machine with sequence manipulation.
result Achieves 100% generalization performance across multiple domains.

In this paper we determine a number of meaningful compositions of higher order of a set of functions, which is considered in Malesevic (1998), in implicit and explicit form. Results which are obtained are applied to the vector analysis in order to determine the number of meaningful differential operations of higher ord…

2004-09-16abs ↗pdf ↗

For CR structures in dimension three, the CR pluriharmonic functions are characterized by the vanishing of a third order operator. This third order operator, after composition with the divergence operator, gives the fourth order analogue of the Paneitz operator. In this short note, we give criteria under which the kern…

2015-02-06abs ↗pdf ↗

Transformers can generalize to a large task family with only a few demonstrations.

problem Can learning from a small set of tasks generalize to a large task family?
method Investigating autoregressive compositional structure where each task is a composition of TT operations, each from a finite family of DD subtasks.
result Transformers can generalize to DTD^T tasks with only O~(D)\widetilde{O}(D) demonstrations.

We consider smooth bounded surfaces with a smooth boundary and a prescribed background metric g_0. We now consider all metrics g conformal to g_0 which have a prescribed volume M. We now minimize the first eigenvalue of the Laplace operator of g over the metrics conformal to g_0 and having the prescribed volume. We sho…

2012-08-27abs ↗pdf ↗

In arXiv:0707.2151 the authors introduced the theory of local representations of the quantum Teichmüller space TSq\mathcal{T}^q_S (qq being a fixed primitive NN-th root of (1)N+1(-1)^{N + 1}) and they studied the behaviour of the intertwining operators in this theory. One of the main results [Theorem 20, arXiv:0707.2151] …

2016-10-19abs ↗pdf ↗

New samplers improve compositional generation with diffusion models.

problem Improving compositional generation with diffusion models.
method Score-based interpretation, energy-based parameterization, Metropolis-corrected samplers.
result New samplers enable successful compositional generation across various tasks.

We study the Berezin-Toeplitz quantization on Kaehler manifolds. We explain first how to compute various associated asymptotic expansions, then we compute explicitly the first terms of the expansion of the kernel of the Berezin-Toeplitz operators, and of the composition of two Berezin-Toeplitz operators. As application…

2010-09-22abs ↗pdf ↗

This paper shows that scientific discovery can be efficiently learned via compositional function trees, reducing the sample complexity.

problem Statistical and computational intractability of scientific discovery via symbolic regression.
method PAC learning approach focusing on compositional function trees built from a finite vocabulary of smooth operators.
result The Rademacher complexity and excess risk are controlled by depth and Lipschitz constants of the base operators, leading to finite-union bounds and high-probability risk bounds.

CoLA automates efficient numerical linear algebra for complex matrix structures.

problem Efficiently solving large-scale linear algebra problems with complex matrix structures.
method Combining linear operator abstraction with compositional dispatch rules.
result Automatic and efficient numerical algorithms for various linear algebra operations.

Green-hyperbolic operators are linear differential operators acting on sections of a vector bundle over a Lorentzian manifold which possess advanced and retarded Green's operators. The most prominent examples are wave operators and Dirac-type operators. This paper is devoted to a systematic study of this class of diffe…

2013-10-02abs ↗pdf ↗

The three operator splitting scheme was recently proposed by [Davis and Yin, 2015] as a method to optimize composite objective functions with one convex smooth term and two convex (possibly non-smooth) terms for which we have access to their proximity operator. In this short note we provide an alternative proof for the…

2016-10-25abs ↗pdf ↗

Several formulas for computing coarse indices of twisted Dirac type operators are introduced. One type of such formulas is by composition product in EE-theory. The other type is by module multiplications in KK-theory, which also yields an index theoretic interpretation of the duality between Roe algebra and stable Hi…

2016-06-03abs ↗pdf ↗

The paper constructs new algebraic structures from Lie algebras and ternary Nambu-Lie algebras, leading to Yang-Baxter operators.

problem Constructing new algebraic structures from Lie algebras and ternary Nambu-Lie algebras.
method Using compositions of binary Lie algebras, 3-Lie algebras, and ternary Nambu-Lie algebras, the paper constructs ternary self-distributive objects and Yang-Baxter operators.
result The constructed Yang-Baxter operators are not gauge equivalent to the transposition operator and can be deformed to new solutions.

CompVAE handles multi-ensemble data with compositional generative model.

problem Handling multi-ensemble data with control and generative models.
method Derived from Bayesian variational principles, CompVAE learns a latent representation leveraging observational and symbolic information.
result Supports compositional generative model enabling multi-ensemble operations.

We study pairs of structures, such as the Poisson-Nijenhuis structures, on the tangent bundle of a manifold or, more generally, on a Lie algebroid or a Courant algebroid. These composite structures are defined by two of the following, a closed 2-form, a Poisson bivector or a Nijenhuis tensor, with suitable compatibilit…

2008-12-30abs ↗pdf ↗

Finding an embedding space for a linear approximation of a nonlinear dynamical system enables efficient system identification and control synthesis. The Koopman operator theory lays the foundation for identifying the nonlinear-to-linear coordinate transformations with data-driven methods. Recently, researchers have pro…

2019-10-18abs ↗pdf ↗

Study meromorphic open-string vertex algebras and modules over Riemannian manifolds.

problem Characterize meromorphic open-string vertex algebras and their modules over Riemannian manifolds.
method Explicitly determine bases for meromorphic open-string vertex algebras and their modules, using parallel tensors and eigenfunctions of the Laplace-Beltrami operator.
result Every irreducible module of a specific type is completely reducible if every composition factor is generated by eigenfunctions of eigenvalue p(p1)Kp(p-1)K for some pZ+p\in \mathbb{Z}_+.

Learning embeddings of entities and relations is an efficient and versatile method to perform machine learning on relational data such as knowledge graphs. In this work, we propose holographic embeddings (HolE) to learn compositional vector space representations of entire knowledge graphs. The proposed method is relate…

2015-10-16abs ↗pdf ↗

We present a method of discovering governing differential equations from data without the need to specify a priori the terms to appear in the equation. The input to our method is a dataset (or ensemble of datasets) corresponding to a particular solution (or ensemble of particular solutions) of a differential equation. …

2019-09-27abs ↗pdf ↗

We describe GJMS-operators as linear combinations of compositions of natural second-order differential operators. These are defined in terms of Poincaré-Einstein metrics and renormalized volume coefficients. As special cases, we find explicit formulas for conformally covariant third and fourth powers of the Laplacian. …

2011-08-01abs ↗pdf ↗

NEON uses neural networks to optimize functions in infinite-dimensional spaces.

problem Optimizing composite functions in function spaces.
method NEON (Neural Epistemic Operator Networks) for sequential decision-making.
result NEON achieves state-of-the-art performance with fewer parameters.

Optimizes convergence rate of stochastic proximal algorithms for composite convex problems.

problem Solving composite convex optimization problems with composite regularizers.
method Analyzed proximal stochastic gradient method and randomized incremental proximal method under relaxed variance assumptions.
result Proves O(1/T)O(1/\sqrt{T}) convergence rate for last iterate of both algorithms under componentwise convexity and smoothness.

Paper explores RKHS properties for derivative and integral operators.

problem Establishing sufficient conditions for reproducing property in RKHS.
method Establishing reproducing property for combinations of composition operators.
result Provides framework for regularized learning algorithms involving function values, gradients, or operators.