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

3436851,0281,370 · Jun 202019922001200920172026
48 results for generating function

The paper extends portfolio theory to include contingent claim functions for option pricing.

problem Developing a method to price options using portfolio generating functions.
method Extending portfolio theory to include contingent claim functions and applying partial differential equations.
result A method to price options using portfolio generating functions and replicable contingent claim functions.

Almost twenty years ago, E.R. Fernholz introduced portfolio generating functions which can be used to construct a variety of portfolios, solely in the terms of the individual companies' market weights. I. Karatzas and J. Ruf recently developed another methodology for the functional construction of portfolios, which lea…

2018-09-26abs ↗pdf ↗

We show that for smooth manifolds X and Y, any isomorphism between the special algebra of Colombeau generalized functions on X, resp. Y is given by composition with a unique Colombeau generalized function from Y to X. We also identify the multiplicative linear functionals from the special algebra of Colombeau generaliz…

2006-12-21abs ↗pdf ↗

Based on Colombeau's theory of algebras of generalized functions we introduce the concepts of generalized functions taking values in differentiable manifolds as well as of generalized vector bundle homomorphisms. We study their basic properties, in particular with respect to some new point value concepts for generalize…

2001-07-06abs ↗pdf ↗

Generative models for function-valued data in infinite dimensions.

problem Lack of semantics relating discretized data to underlying functional forms.
method Generalized diffusion models to function space, using Gaussian measures on Hilbert spaces.
result Explicit specification of function space allows unconditional and conditional generation of function-valued data.

The paper classifies singularities of plane congruences and affine distance functions.

problem Classifying singularities of plane congruences and affine distance functions.
method Classification through 2-parameter plane congruences in \(\mathbb{R^4}\) and affine normal plane congruences.
result Generic singularities of plane congruences and affine distance functions are classified.

Study one-dimensional topological theories with linear generating functions.

problem Understanding one-dimensional topological theories with defects.
method Construct bases of hom spaces for decorated unoriented one-dimensional cobordisms.
result Gram determinant and linear generating functions constructed.

New LL-functions for 3-manifolds connect to Witten invariants and relate to generalized Bernoulli polynomials.

problem Understanding LL-functions for 3-manifolds and their invariants.
method Using Mellin transforms and asymptotic techniques, proving entire functions and their values.
result Linear relations between LL-function values at negative integers, generalizing known zeta functions.

Study shows infoGAN's generalization error bound for two-layer networks.

problem Understanding generalization error in infoGAN for two-layer neural networks.
method Analyzes the difference between empirical and population objective functions, derives Rademacher complexity bounds.
result Derives error bound for infoGAN's generalization error in a two-layer network.

New insights into risk aversion for complex decision models.

problem Understanding risk aversion in non-monotone decision models.
method Characterization of probabilistic risk aversion for generalized rank-dependent functions.
result Probabilistic risk aversion is determined by the distortion function, which is convex or scaled quantile-spread mixtures.

We propose fast approximations for the generalized sliced-Wasserstein distance.

problem Efficient approximation of the generalized sliced-Wasserstein distance in high dimensions.
method Deterministic approximations using random projections and concentration of measure results.
result One-dimensional projections of high-dimensional random vectors are approximately Gaussian.

Sharp bounds for approximating Sobolev functions by ridge functions and networks.

problem Approximating Sobolev functions with multivariate ridge functions and networks.
method Proving sharp upper and lower bounds for approximation order.
result Order of approximation asymptotically behaves as nr/(d)n^{-r/(d-\ell)}.

Paper develops efficient RL algorithm for general value function approximation.

problem Lack of theory for RL with general value function approximation.
method Provable efficient RL algorithm using bounded eluder dimension.
result Achieves a regret bound of O~(poly(dH)T)\widetilde{O}(\mathrm{poly}(dH)\sqrt{T}).

Generative model learns functional vector fields for pharmacokinetics.

problem Generating accurate virtual cohorts and forecasting patient trajectories without manual tuning.
method Prior-Fitted Functional Flows model, learning functional vector fields conditioned on sparse, irregular data.
result State-of-the-art predictive accuracy on real-world datasets.

Generative models learn distributions of continuous functions.

problem Training generative models on discretized grids limits model size and data type.
method Parameterize data points by continuous functions, learn distributions over these functions.
result Models can learn rich distributions of functions independently of data type and resolution.

We extend rectified flow to infinite-dimensional Hilbert space.

problem Extending rectified flow to infinite-dimensional spaces.
method Established a rigorous functional formulation using the superposition principle for continuity equations.
result Demonstrated superior performance compared to existing models.

New neural network models learn symmetric functions of varying input sizes.

problem Learning symmetric functions with varying input sizes.
method Functional perspective on neural networks, treating symmetric functions as functions over probability measures.
result Established approximation and generalization bounds for shallow architectures that extend across input sizes.

We present a novel and comprehensive approach to the study of the parametric Plateau problem for locally strictly convex (LSC) hypersurfaces of prescribed curvature for general convex curvature functions inside general Riemannian manifolds. We prove existence of solutions to the Plateau problem with outer barrier for L…

2010-08-20abs ↗pdf ↗

Estimates generalization gap for overparameterized models using Langevin approximation.

problem Estimating the difference between training and generalization performance in overparameterized models.
method Functional variance and Langevin approximation of functional variance.
result Demonstrates efficient estimation of generalization gaps for overparameterized models.

We describe the Williams zeta functions and the twist zeta functions of sub-Lorenz templates generated by renormalizable Lorenz maps, in terms of the corresponding zeta-functions of the sub-Lorenz templates generated by the renormalized map and by the map that determines the renormalization type.

2010-03-25abs ↗pdf ↗

A Morse 2-function is a generic smooth map from a smooth manifold to a surface. In the absence of definite folds (in which case we say that the Morse 2-function is indefinite), these are natural generalizations of broken (Lefschetz) fibrations. We prove existence and uniqueness results for indefinite Morse 2-functions …

2011-02-03abs ↗pdf ↗

The goal of this paper is to classify pairs of Morse functions in general position modulo the action of different groups.In particular, we obtain the classification of generic pairs of Morse functions, with or without target diffeomorphisms, and that of quotients of Morse functions.We will also present a lemma which gi…

2017-03-06abs ↗pdf ↗

We study the smooth structure of convex functions by generalizing a powerful concept so-called self-concordance introduced by Nesterov and Nemirovskii in the early 1990s to a broader class of convex functions, which we call generalized self-concordant functions. This notion allows us to develop a unified framework for …

2017-03-14abs ↗pdf ↗

We extend the problem of finding Hamiltonian-invariant volume forms on a Poisson manifold to the problem of construction of Hamiltonian-invariant generalized functions. For this we introduce the notion of generalized center of a Poisson algebra, which is the space of generalized Casimir functions. We study as the case …

2003-01-31abs ↗pdf ↗

The vicinal risk minimization (VRM) principle, first proposed by \citet{vapnik1999nature}, is an empirical risk minimization (ERM) variant that replaces Dirac masses with vicinal functions. Although there is strong numerical evidence showing that VRM outperforms ERM if appropriate vicinal functions are chosen, a compre…

2018-11-11abs ↗pdf ↗

A new method uses deep learning to efficiently sample rare transitions for estimating committor functions.

problem Efficiently sampling rare transitions to estimate committor functions in high-dimensional problems.
method DASTR (Deep Adaptive Sampling on Transition Paths) method using deep generative models.
result Significantly improved accuracy in approximating committor functions through efficient sampling.

Extends Tanimoto kernel to real-valued functions.

problem Measuring similarity between real-valued functions.
method Unified representation of real-valued functions via sets, derived general form of the kernel, explicit feature representation, and smooth approximation.
result General Tanimoto kernel for real-valued functions.

We discuss the nature of structure-preserving maps of varies function algebras. In particular, we identify isomorphisms between special Colombeau algebras on manifolds with invertible manifold-valued generalized functions in the case of smooth parametrization. As a consequence, and to underline the consistency and vali…

2010-10-18abs ↗pdf ↗

The study optimizes bounds for comparing training and population loss.

problem Optimizing bounds for comparing training and population loss.
method Derives generic information-theoretic and PAC-Bayesian generalization bounds using convex comparator functions.
result The tightest possible bound is obtained with the comparator being the convex conjugate of the CGF of the bounding distribution.