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

2805608401,120 · Jun 202019922001200920172026
48 results for representation function class

The paper computes characteristic classes for Lie group representations.

problem Computing characteristic classes for Lie group representations.
method The paper outlines a procedure to compute characteristic classes of irreducible representations of Lie groups, expressing them as polynomial functions in the highest weight.
result The paper expresses characteristic classes of Lie group representations as polynomial functions in the highest weight.

Paper proposes a loss extension for neural networks to improve OSR performance.

problem Open set recognition problem, distinguishing known and unknown classes.
method Introduces a loss function extension to find more discriminative polar representations.
result Significantly improves performance on datasets from different domains.

We study Anosov representations whose limit set has intermediate regularity, namely is a Lipschitz submanifold of a flag manifold. We introduce an explicit linear functional, the unstable Jacobian, whose orbit growth rate is integral on this class of representations. We prove that many interesting higher rank represent…

2019-10-15abs ↗pdf ↗

This paper introduces a new feature learning technique based on error representation.

problem Learning high-level features for classification from diverse and imbalanced data.
method Inverse feature learning using error representation approach.
result Significantly better performance compared to state-of-the-art techniques.

We define the representation ring of a saturated fusion system F\mathcal F as the Grothendieck ring of the semiring of F\mathcal F-stable representations, and study the dimension functions of F\mathcal F-stable representations using the transfer map induced by the characteristic idempotent of F\mathcal F. We find a…

2016-03-27abs ↗pdf ↗

For each oriented surface ΣΣ of genus gg we study a limit of quantum representations of the mapping class group arising in TQFT derived from the Kauffman bracket. We determine that these representations converge in the Fell topology to the representation of the mapping class group on $\boH(Σ)$, the space of regular f…

2006-04-25abs ↗pdf ↗

Generalized matrix-fractional (GMF) functions are a class of matrix support functions introduced by Burke and Hoheisel as a tool for unifying a range of seemingly divergent matrix optimization problems associated with inverse problems, regularization and learning. In this paper we dramatically simplify the support func…

2017-03-04abs ↗pdf ↗

This paper connects Laguerre minimal surfaces to Weierstrass representations.

problem Understanding the relationship between Laguerre minimal surfaces and Weierstrass representations.
method Defining spherical mean curvature and providing Weierstrass-type representations for two classes of surfaces.
result Laguerre minimal surfaces are related to H2H_2-surfaces, providing a new Weierstrass-type representation.

In this paper we study a class of functions that appear naturally in some equidistribution problems and that we call FF-harmonic. These are functions of the universal cover of a closed and negatively curved which possess an integral representation analogous to the Poisson representation of harmonic functions, where th…

2014-07-02abs ↗pdf ↗

This paper improves few-shot learning by reducing sample complexity using representation learning.

problem Reducing sample complexity for target tasks with limited data.
method Representation learning to pool all source task samples for target task learning.
result Representation learning can achieve substantial sample size reduction, bypassing the $Ω( rac{1}{T})$ barrier.

Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problem. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basic matrix and a nonnegative coefficient matrix, and the coefficient matrix is used as the new representation. …

2013-12-05abs ↗pdf ↗

We study a class of elastic energy functionals for maps between planar domains (among them the so-called squared distance functional) whose critical points (elastic maps) allow a far more complete theory than one would expect from general elasticity theory. For some of these functionals elastic maps even admit a "Weier…

2017-06-20abs ↗pdf ↗

ReLEX algorithm improves RL efficiency by selecting optimal representations.

problem Improving reinforcement learning efficiency through better representation selection.
method Proposes ReLEX algorithm for both online and offline RL, focusing on bilinear transition kernels.
result ReLEX algorithms achieve optimal or near-optimal performance in both online and offline RL settings.

Let S be a closed orientable surface of genus at least 2 and let G be a semisimple real algebraic group of non-compact type. We consider a class of representations from the fundamental group of S to G called positively ratioed representations. These are Anosov representations with the additional condition that certain …

2016-09-05abs ↗pdf ↗

The paper studies geometric representations of submanifolds using complex-valued functions.

problem Exploring the geometry of codimension-2 submanifolds.
method Implicitly representing submanifolds by complex-valued functions and showing a prequantum bundle structure.
result The space of implicit representations admits a prequantum bundle structure over the space of submanifolds.

Two approaches to directly estimating Riesz representer are shown to be numerically equivalent under certain conditions.

problem Estimating Riesz representer in semiparametric statistics.
method Two distinct optimization problems solved by automatic debiased machine learning and sieve methods for conditional moment models.
result Numerical equivalence of estimators under specific regularization schemes, but not for others.

Bismut and Zhang computed the ratio of the Ray-Singer and the combinatorial torsions corresponding to non-unitary representations of the fundamental group. In this note we show that for representations which belong to a connected component containing a unitary representation the Bismut-Zhang formula follows rather easi…

2013-04-19abs ↗pdf ↗

New proof shows efficient ReLU networks for piecewise linear functions.

problem Existence of efficient ReLU neural networks for piecewise linear functions.
method Degree 1 triangulations of the relative homology class bounded by polyhedra.
result Existence of efficient ReLU neural networks for functions with compact support.

SOC-ICNN expands neural network representational capacity by using conic optimization.

problem Restrictive representational capacity of ReLU-based ICNNs.
method Proposes SOC-ICNN architecture that uses Second-Order Cone Programming.
result SOC-ICNN strictly expands representational space without increasing complexity.

A relation between the Goldstein-Petrich hierarchy for plane curves and the Toda lattice hierarchy is investigated. A representation formula for plane curves is given in terms of a special class of ττ-functions of the Toda lattice hierarchy. A representation formula for discretized plane curves is also discussed.

2013-10-26abs ↗pdf ↗

Many theories of deep learning have shown that a deep network can require dramatically fewer resources to represent a given function compared to a shallow network. But a question remains: can these efficient representations be learned using current deep learning techniques? In this work, we test whether standard deep l…

2018-07-17abs ↗pdf ↗

Study dynamic risk measures and performance indices using distortion functions.

problem Investigate time consistency of dynamic risk measures and performance indices generated by distortion functions.
method Analyze dynamic coherent risk measures (DCRMs) and dynamic weighted value at risk measures, proving their equivalence. Establish properties of families of DCRMs generated by distortion functions and define corresponding dynamic coherent acceptability indices (DCAIs). Examine time consistency of DCRMs and DCAIs.
result DCRM generated by distortion functions are sub-martingale time consistent but not super-martingale time consistent and not weakly acceptance time consistent.

In the artificial intelligence field, learning often corresponds to changing the parameters of a parameterized function. A learning rule is an algorithm or mathematical expression that specifies precisely how the parameters should be changed. When creating an artificial intelligence system, we must make two decisions: …

2017-06-09abs ↗pdf ↗

Unified theory for representation learning using learnable functions.

problem Insufficient theoretical understanding of unsupervised and self-supervised learning.
method Discriminative theoretical framework for analyzing sample complexity.
result Learnable regularization functions can reduce the amount of labeled data needed.

New CH covariance class improves spatial statistics by balancing differentiability and tail behavior.

problem Lack of control over mean-square differentiability and tail behavior in Matérn covariance functions.
method Developed a new Confluent Hypergeometric (CH) covariance class using a scale mixture of Matérn and polynomial covariances.
result The CH class offers improved theoretical properties and better performance in extrapolative settings.

Study subgroup actions on mapping class groups using Heisenberg representations.

problem Untwisting representations of mapping class groups on Heisenberg subgroups.
method Restrict and analyze twisted representations of mapping class groups to Heisenberg subgroups.
result Untwisting representations on Torelli group for any Heisenberg representation.

Given a Lie group G whose Lie algebra is endowed with a nondegenerate invariant symmetric bilinear form, we construct a Poisson algebra of continuous functions on a certain open subspace R of the space of representations in G of the fundamental group of a compact connected orientable topological surface with finitely m…

1997-10-29abs ↗pdf ↗

This work explores representation complexity in RL paradigms, revealing model-based RL as the easiest task.

problem Investigating the representation complexity gap among model-based, policy-based, and value-based RL.
method Demonstrated through analysis of Markov decision processes (MDPs) and introduced new classes of MDPs.
result Representation complexity hierarchy: model-based RL > policy-based RL > value-based RL.

Bin2vec learns executable program representations for security tasks.

problem Manual rule and heuristic definition for binary program analysis is tedious and time-consuming.
method Bin2vec uses Graph Convolutional Networks (GCN) on computational program graphs.
result Improvement over state-of-the-art methods for binary analysis tasks.

Counterexample and new proof for curvature varifolds.

problem Counterexample to Hutchinson's proof and new proof of C1,αC^{1,α} representation.
method Alternative proof method and decomposition of varifolds.
result Structure theorem for curvature varifolds with null second fundamental form.

CPPO learns policies from partial offline data in MDPs with structural assumptions.

problem Offline Reinforcement Learning with partial coverage assumption.
method Constrained Pessimistic Policy Optimization (CPPO) using a function class and model class constraint.
result CPPO achieves PAC guarantee with partial coverage, learning competitive policies.

The symplectic representation of mapping classes is not surjective for certain types of mapping classes.

problem The surjectivity of the symplectic representation of mapping classes, particularly pseudo-Anosov ones, is not always preserved.
method Explicit construction of symplectic matrices with a bi-Perron leading eigenvalue that cannot be represented by orientable pseudo-Anosov mapping classes.
result The symplectic representation of orientable pseudo-Anosov mapping classes is not surjective.

This paper is concerned with the approximation of high-dimensional functions in a statistical learning setting, by empirical risk minimization over model classes of functions in tree-based tensor format. These are particular classes of rank-structured functions that can be seen as deep neural networks with a sparse arc…

2018-11-11abs ↗pdf ↗

Graph convolutional networks adapt the architecture of convolutional neural networks to learn rich representations of data supported on arbitrary graphs by replacing the convolution operations of convolutional neural networks with graph-dependent linear operations. However, these graph-dependent linear operations are d…

2017-11-03abs ↗pdf ↗

The energy of harmonic sections of flat bundles of nonpositively curved (NPC) length spaces over a Riemann surface SS is a function EρE_ρ on Teichmüller space $\Teich$ which is a qualitative invariant of the holonomy representation ρρ of π1(S)π_1(S). Adapting ideas of Sacks-Uhlenbeck, Schoen-Yau and Tromba, we show that…

2005-06-10abs ↗pdf ↗

We show that the first Johnson subgroup of the mapping class group of a surface S of genus greater than one acts ergodically on the moduli space of representations of the fundamental group of S in SU_2. Our proof relies on a local description of the latter space around the trivial representation and on the Taylor expan…

2012-06-12abs ↗pdf ↗

Softmax temperature influences model representation rank and performance.

problem Understanding and optimizing softmax function's impact on model representations.
method Investigated softmax function's role in deep neural networks, introduced rank deficit bias.
result Softmax temperature affects model representation rank and can improve performance.