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

105210315420 · Jun 202019922001200920172026
48 results for parametric representation

Researchers parametrize spaces of positive representations for Lie groups.

problem Tackling spaces of positive representations for Lie groups.
method Generalizing Lusztig's total positivity, they introduce spaces of positive framed representations and parametrize them.
result The number of connected components of the space of framed positive representations agrees with the number of positive representations.

The paper parametrizes spaces of maximal framed representations for a specific type of surface group.

problem Counting connected components and maximal representations for a specific type of surface group.
method Parametrization of spaces of maximal framed representations using a Hermitian Lie group of tube type.
result Counted connected components and maximal representations for the space of maximal framed representations.

Representation costs in data science: Unifying function-space views of parametric methods

problem Analyzing representation costs of parametric data-fitting methods
method Developing a general framework for analyzing representation costs through parameter-space regularizers
result Proving that many natural results hold in this abstract setting, including representer theorems for parametric methods on their native spaces

New parametrizations for minimal timelike surfaces discovered.

problem Finding parametrizations for minimal timelike surfaces in specific spaces.
method Derived representation formulas for null curves leading to parametrizations of minimal timelike surfaces.
result Examples of minimal timelike surfaces constructed.

Weierstrass representation is a classical parameterization of minimal surfaces. However, two functions should be specified to construct the parametric form in Weierestrass representation. In this paper, we propose an explicit parametric form for a class of parametric polynomial minimal surfaces of arbitrary degree. It …

2010-08-01abs ↗pdf ↗

Study identifies specialist representations from generalist models without parametric constraints.

problem Identify task-relevant latent representations from generalist models.
method Nonparametric, fully unsupervised approach, proving identifiability of task structure and latent representations.
result Identifiability of task structure and latent representations in a nonparametric setting.

Proposes a flexible framework for implied volatility surfaces with random parameters.

problem Inconsistent calibration of parametric implied volatility models when market volatility deviates from the model's regime.
method Introduces random coefficients for parametric implied volatility formulas, preserving analytic flexibility and efficiency.
result Demonstrates improved modeling of implied volatility curves, especially for short-term options and earnings announcements.

A new geometric metric identifies true data changes from parametrization artifacts in high-dimensional representations.

problem Quantifying representation drift in high-dimensional data using Euclidean or cosine distances can misattribute changes due to arbitrary parametrizations.
method Introducing the Fubini Study metric to identify representations that differ only by gauge transformations.
result The Fubini Study metric isolates intrinsic evolution by remaining invariant under gauge-induced fluctuations, providing a diagnostic for meaningful structural changes.

In a previous paper, we parametrized boundary-unipotent representations of a 3-manifold group into SL(n,C) using Ptolemy coordinates, which were inspired by A-coordinates on higher Teichmüller space due to Fock and Goncharov. In this paper, we parametrize representations into PGL(n,C) using shape coordinates which are …

2012-07-28abs ↗pdf ↗

New method estimates survival risks without strong proportional hazard assumptions.

problem Time-to-event prediction with censored data and competing risks.
method Jointly learns deep nonlinear representations for fully parametric survival regression.
result Demonstrates benefits in real-world datasets with different censoring levels.

This paper starts a systematic description of colored knot polynomials, beginning from the first non-(anti)symmetric representation R=[2,1]. The project involves several steps: (i) parametrization of big families of knots a la arXiv:1506.00339, (ii) evaluating Racah/mixing matrices for various numbers of strands in var…

2015-08-12abs ↗pdf ↗

For a compact 3-manifold M with arbitrary (possibly empty) boundary, we give a parametrization of the set of conjugacy classes of boundary-unipotent representations of the fundamental group of M into SL(n,C). Our parametrization uses Ptolemy coordinates, which are inspired by coordinates on higher Teichmueller spaces d…

2011-11-11abs ↗pdf ↗

DeepAveragers solves offline RL by solving derived MDPs from static data.

problem Offline reinforcement learning with limited data.
method Solves derived non-parametric MDPs (DAC-MDPs) using deep representations and costs for under-represented parts.
result The approach can lower-bound performance and scale to complex offline RL problems.

We propose a discrete surface theory in R3\mathbb R^3 that unites the most prevalent versions of discrete special parametrizations. This theory encapsulates a large class of discrete surfaces given by a Lax representation and, in particular, the one-parameter associated families of constant curvature surfaces. The theo…

2014-12-23abs ↗pdf ↗

We present two different representations of (1,1)-knots and study some connections between them. The first representation is algebraic: every (1,1)-knot is represented by an element of the pure mapping class group of the twice punctured torus. The second representation is parametric: every (1,1)-knot can be represented…

2005-01-14abs ↗pdf ↗

We give a description of several representation varieties of the fundamental group of the complement of the figure eight knot in PGL(3,C) or SL(3,C). We moreover obtain an explicit parametrization of matrices generating the representation and a description of the projection of the representation variety into the charac…

2014-12-15abs ↗pdf ↗

This research uses DPPs to improve semi-parametric regression models.

problem Improving comprehensibility in semi-parametric regression models without sacrificing accuracy.
method Introduced a novel representation of finite DPPs and used it to derive a key identity illustrating implicit regularization.
result Demonstrated the implicit regularization effect of determinantal sampling for semi-parametric regression.

A new approach to unsupervised learning using recognition-parametrised models.

problem Discovering meaningful latent structure in observational data.
method Recognition-Parametrised Model (RPM) combining parametric and non-parametric components.
result Effective learning of latent structure without explicit generative models.

Our work proves CSF can recover ground-truth features in RL, improving understanding of feature learning.

problem Understanding the role of representation and mutual information in reinforcement learning.
method Investigates Contrastive Successor Features (CSF) method for identifiable representation learning in reinforcement learning.
result Proves CSF can recover ground-truth features up to a linear transformation.

Let ΣgΣ_g be a compact, connected, orientable surface of genus g2g \geq 2. We ask for a parametrization of the discrete, faithful, totally loxodromic representations in the deformation space Hom(π1(Σg),SU(3,1))/SU(3,1){\rm Hom}(π_1(Σ_g), {\rm SU}(3,1))/{\rm SU}(3,1). We show that such a representation, under some hypothesis, can be determined …

2014-11-25abs ↗pdf ↗

New proofs given for space curves with totally positive torsion.

problem Description of convex hulls of space curves with totally positive torsion.
method New proofs of parametric representation, surface area, and volume formulas.
result Recovery of formulas for convex hull's surface area and volume.

In this paper we present an application of the use of autocopulas for modelling financial time series showing serial dependencies that are not necessarily linear. The approach presented here is semi-parametric in that it is characterized by a non-parametric autocopula and parametric marginals. One advantage of using au…

2015-07-16abs ↗pdf ↗

In this paper, we suggest a framework to make use of mutual information as a regularization criterion to train Auto-Encoders (AEs). In the proposed framework, AEs are regularized by minimization of the mutual information between input and encoding variables of AEs during the training phase. In order to estimate the ent…

2017-06-14abs ↗pdf ↗

We develop Fenchel-Nielsen coordinates for representations of surface groups into Sp(2n,R) with maximal Toledo invariant. Analogous to classical Fenchel-Nielsen coordinates on the Teichmüller space they consist of a parametrization of representations of the fundamental group of a pair of pants and a careful investigati…

2012-04-03abs ↗pdf ↗

Semi-parametric survival analysis methods like the Cox Proportional Hazards (CPH) regression (Cox, 1972) are a popular approach for survival analysis. These methods involve fitting of the log-proportional hazard as a function of the covariates and are convenient as they do not require estimation of the baseline hazard …

2019-05-14abs ↗pdf ↗

The paper identifies a component of representations mapping modular group elements to isometries with unique fixed points.

problem Characterizing representations of the modular group into isometry groups.
method Analyzing the space of discrete faithful representations of the modular group into Isom(X) for X=SL3(R)/SO(3).
result The space of representations has a component homeomorphic to R^2 x [0,∞), parametrized by Pappus representations and containing Anosov representations.

This paper shows how deep neural networks can learn rich, independent features that significantly deviate from initialization.

problem Understanding how deep neural networks achieve meaningful feature learning and global convergence.
method Investigation of infinitely wide, LL-layer neural networks using the tensor program framework under Maximal Update parametrization.
result SGD enables these networks to learn linearly independent features that substantially deviate from their initial values, capturing relevant data information.