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

106213319425 · Jun 202019922001200920172026
48 results for Representer Theorem

Novel representer theorem for metric and preference learning in RKHSs.

problem Metric and preference learning problems in Hilbert spaces.
method Regularization with respect to task structure norm, RKHS representation, and novel algorithm.
result Significant performance improvement over baseline methods in real-world rank inference benchmarks.

We consider a general regularised interpolation problem for learning a parameter vector from data. The well known representer theorem says that under certain conditions on the regulariser there exists a solution in the linear span of the data points. This is at the core of kernel methods in machine learning as it makes…

2018-09-26abs ↗pdf ↗

Study k-positive surface group representations and their degenerations.

problem Understanding the behavior of surface group representations under degenerations.
method Introduced k-positive representations and studied their degenerations using a limit theorem for positively ratioed representations.
result Degenerations of k-positive representations can lead to limits that are at least (k-3)-positive and irreducible limits are (k-1)-positive.

New examples of embeddings defy Anosov representation limits.

problem Examples of robust quasi-isometric embeddings not approximated by Anosov representations.
method Exhibited non-locally rigid, Zariski dense embeddings in SLm(K)\mathsf{SL}_m(\mathbb{K}).
result Higher rank Anosov representation theorems fail for m30m\geq 30.

Geometrically, Kostant's Convexity Theorem is extended to submetries with a fat section.

problem Extending Kostant's Convexity Theorem to a broader class of representations.
method Introducing a new concept of 'fat section' and proving the theorem for submetries with this property.
result Kostant's Convexity Theorem is partially extended to submetries with a fat section.

New representations defined for groups and graphs, with applications to stable representations.

problem Defining and constructing new types of representations for groups and graphs.
method Introducing (R,Λ)(R,Λ)-directed Anosov representations and using Fock-Goncharov positivity to construct them.
result Constructs large families of primitive stable representations from F2F_2 to PGL(V)\mathrm{PGL}(V), including non-discrete and non-faithful examples.

By using a Borel density theorem for algebraic quotients, we prove a theorem concerning isometric actions of a Lie group GG on a smooth or analytic manifold MM with a rigid A\mathrm{A}-structure σσ. It generalizes Gromov's centralizer and representation theorems to the case where R(G)R(G) is split solvable and $G/R(G…

2010-05-09abs ↗pdf ↗

We present a new direct proof of a topological representation theorem for oriented matroids in the general rank case. Our proof is based on an earlier rank 3 version. It uses hyperline sequences and the generalized Sch{ö}nflies theorem. As an application, we show that one can read off oriented matroids from arrangement…

2002-09-26abs ↗pdf ↗

We generalize a theorem of Burde and de Rham characterizing the zeros of the Alexander polynomial. Given a representation of a knot group ππ, we define an extension of ππ, the Crowell group. For any GL(n,C) representation of ππ, the zeros of the associated twisted Alexander polynomial correspond to representations o…

2009-08-16abs ↗pdf ↗

The necessary and sufficient conditions for existence of a generalized representer theorem are presented for learning Hilbert space-valued functions. Representer theorems involving explicit basis functions and Reproducing Kernels are a common occurrence in various machine learning algorithms like generalized least squa…

2018-09-19abs ↗pdf ↗

Revisits the connection between neural networks and the Kolmogorov-Arnold theorem.

problem Explains the limitations of using the Kolmogorov-Arnold theorem to explain neural networks with multiple hidden layers.
method Derives modifications of the Kolmogorov-Arnold representation that transfer smoothness properties to the outer function and can be well approximated by ReLU networks.
result Shows that a deep neural network with most layers approximating the interior function is a more natural interpretation of the Kolmogorov-Arnold representation.

We prove a theorem relating the automorphism group of a Cartan geometry to the group on which the geometry is modeled: a component of the adjoint representation of the first embeds in the adjoint representation of the second. Consequences of the theorem include general bounds on the rank and nilpotence degree of an aut…

2007-09-24abs ↗pdf ↗

New proof of Alesker's Irreducibility Theorem using localization techniques.

problem Representing polynomial valuations on convex bodies.
method Introducing a localization technique for polynomial valuations and reducing to a representation problem for differential forms.
result Smooth and translation invariant valuations are representable by integration with the normal cycle.

PARIS reduces imbalanced regression datasets by pruning uninformative samples.

problem Imbalanced regression where models focus on high-frequency regions, ignoring rare but impactful events.
method PARIS uses the representer theorem to compute a closed-form representer deletion residual for iterative pruning of the training set.
result PARIS reduces training set by up to 75% while preserving or improving overall performance, outperforming other methods.

Paper proves almost all stabilizer subgroups of Thompson's group satisfy Alexander's theorem.

problem Alexander's theorem for stabilizer subgroups of Thompson's group.
method Defined a method to construct knots and links from Thompson's group F and proved Alexander's theorem for stabilizer subgroups.
result Almost all stabilizer subgroups under the natural action on the unit interval satisfy Alexander's theorem.

This paper presents the first use of graph neural networks (GNNs) for higher-order proof search and demonstrates that GNNs can improve upon state-of-the-art results in this domain. Interactive, higher-order theorem provers allow for the formalization of most mathematical theories and have been shown to pose a significa…

2019-05-24abs ↗pdf ↗

We introduce the idea of *representation stability* (and several variations) for a sequence of representations V_n of groups G_n. A central application of the new viewpoint we introduce here is the importation of representation theory into the study of homological stability. This makes it possible to extend classical t…

2010-08-07abs ↗pdf ↗

In this paper we explain how Morse theory for the Yang-Mills functional can be used to prove an analogue, for surface groups, of the Atiyah-Segal theorem. Classically, the Atiyah-Segal theorem relates the representation ring R(Γ) of a compact Lie group ΓΓ to the complex K-theory of the classifying space BΓ. For infi…

2007-10-03abs ↗pdf ↗

In the paper "Pappus's theorem and the modular group", R. Schwartz constructed a 2-dimensional family of faithful representations ρΘρ_Θ of the modular group PSL(2,Z)\mathrm{PSL}(2,\mathbb{Z}) into the group G\mathscr{G} of projective symmetries of the projective plane via Pappus Theorem. The image of the unique index 2 subg…

2016-10-13abs ↗pdf ↗

Geometric models for representations up to homotopy using simplicial vector bundles.

problem Geometric models for representations up to homotopy of Lie groupoids.
method Application of higher analogs of cleavages in simplicial fibrations to geometric models.
result An equivalence between representations up to homotopy and simplicial vector bundles endowed with a cleavage.

The paper proves approximation and interpolation theorems for maxfaces with singularities.

problem Proving approximation and interpolation theorems for maxfaces with singularities.
method Surveying and applying Enneper--Weierstrass representation formula methods to maxfaces, incorporating singularity criteria.
result Existence of maxfaces with prescribed singularities and maxfaces with dense image singular set.

the main theorem gives a sufficient condition for a n elements of SL(2,R) to generate a free group.The idea behind it is to use a nonorientable version of the Dehn-Wolpert-Goldman twist and to sew it with the original representation of a free group to get representation of the closed surfase group and then to apply Gol…

1997-09-06abs ↗pdf ↗

Paper develops efficient estimator for Hawkes processes using representer theorem.

problem Estimating latent triggering kernels for Hawkes processes from event sequences.
method Penalized least squares minimization in RKHS framework.
result Efficient estimator with competitive accuracy and improved computational efficiency.

In LM, we proved a family version of the famous Witten rigidity theorems and several family vanishing theorems for elliptic genera. In this paper, we gerenalize our theorems LM in two directions. First we establish a family rigidity theorem for the Dirac operator on loop space twisted by general positive energy loop gr…

1999-11-05abs ↗pdf ↗

Factorizes discrete representations of finitely generated groups into PSL(2, R).

problem Understanding discrete representations of finitely generated groups into PSL(2, R).
method Factorization theorem for Fuchsian groups, Makanin-Razborov diagrams, and new class of groups called PSL(2, R)-discrete limit groups.
result Obtained useful information about PSL(2, R)-discrete limit groups.

Paper uses index theorem to relate symplectic bundle signature to surface group representation in real symplectic group.

problem Relating symplectic bundle signature to surface group representations in real symplectic group.
method Using Atiyah-Patodi-Singer index theorem.
result Obtained a formula for the signature of a flat symplectic vector bundle over a surface with boundary.

The paper classifies fiber structures of discontinuity domains for Anosov representations.

problem Understanding the topology of discontinuity domains for Anosov representations.
method Explicitly working out a smooth version of Fintushel's classification theorem for S1S^1-actions on 4-manifolds.
result The action on the fiber is equivalent to a circle action on a Hirzebruch surface.

We prove universality theorems ("Murphy's Laws") for representation schemes of fundamental groups of closed 3-dimensional manifolds. We show that germs of SL(2,C)-representation schemes of such groups are essentially the same as germs of schemes of over rational numbers.

2013-03-10abs ↗pdf ↗

The article extends Thurston's Grafting Theorem to signed spaces and defines a framed monodromy map.

problem Extending Thurston's Grafting Theorem to signed spaces.
method Proves the analogue of Thurston's Grafting Theorem for signed spaces, defines a framed monodromy map.
result Characterizes PSL(2,C)-representations and shows the monodromy map is a local biholomorphism.

We give a new proof of Markov's classical theorem relating any two closed braid representations of the same knot or link. The proof is based upon ideas in a forthcoming paper by the authors, "Stabilization in the braid groups". The new proof of the classical Markov theorem is used by Nancy Wrinkle in her forthcoming ma…

2002-02-18abs ↗pdf ↗

DM improves self-supervised transfer learning by matching target distributions.

problem Improving self-supervised transfer learning performance.
method Distribution Matching (DM) method that drives representation distribution towards a predefined reference distribution.
result DM outperforms existing methods on target classification tasks.

Let ΓΓ be a nonuniform lattice acting on real hyperbolic n-space. We show that in dimension greater than or equal to 4, the volume of a representation is constant on each connected component of the representation variety of ΓΓ in SO(n,1). Furthermore, in dimensions 2 and 3, there is a semialgebraic subset of the repr…

2013-10-04abs ↗pdf ↗