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

11223344 · Jun 202019922001200920172026
48 results for TCM nets

Wide hidden layer TCM nets capacity analyzed using RDT and fl RDT.

problem Capacity analysis of wide hidden layer TCM nets.
method Employed Fully Lifted Random Duality Theory (fl RDT) for capacity characterization.
result Explicit, closed form capacity characterizations for a generic class of hidden layer activations.

New method allocates capital based on tail central moments for financial risk assessment.

problem Inability of CTE-based capital allocation to reflect tail behavior of losses.
method Developed TCM-based capital allocation for normal mean-variance mixture distributions.
result TCM-based method captures tail risk contributions not detected by CTE.

In distributed function computation, each node has an initial value and the goal is to compute a function of these values in a distributed manner. In this paper, we propose a novel token-based approach to compute a wide class of target functions to which we refer as "Token-based function Computation with Memory" (TCM) …

2017-03-26abs ↗pdf ↗

DUET enhances multivariate time series forecasting by clustering time and channels.

problem Heterogeneous temporal patterns and complex channel correlations in multivariate time series.
method DUET uses dual clustering on temporal and channel dimensions to handle these challenges.
result DUET achieves state-of-the-art performance on 25 real-world datasets.

New bounds on neural network capacity for treelike sign perceptrons using RDT.

problem Determining the capacity of treelike sign perceptrons neural networks.
method Random Duality Theory (RDT) to establish upper bounds.
result Mathematically rigorous bounds on network capacity for any number of neurons.

The paper explores discrete isothermic nets using checkerboard patterns in quadrilateral nets.

problem Defining and understanding discrete isothermic nets in quadrilateral nets.
method Using checkerboard patterns and discrete differential geometry to define and analyze isothermic nets.
result The class of isothermic nets is invariant under dualization and Moebius transformations.

In this paper, we introduce transformations of deep rectifier networks, enabling the conversion of deep rectifier networks into shallow rectifier networks. We subsequently prove that any rectifier net of any depth can be represented by a maximum of a number of functions that can be realized by a shallow network with a …

2017-03-30abs ↗pdf ↗

We discuss discretization of Koenigs nets (conjugate nets with equal Laplace invariants) and of isothermic surfaces. Our discretization is based on the notion of dual quadrilaterals: two planar quadrilaterals are called dual, if their corresponding sides are parallel, and their non-corresponding diagonals are parallel.…

2007-09-21abs ↗pdf ↗

We study local and global approximations of smooth nets of curvature lines and smooth conjugate nets by respective discrete nets (circular nets and planar quadrilateral nets) with infinitesimal quads. It is shown that choosing the points of discrete nets on the smooth surface one can obtain second-order approximation g…

2007-06-21abs ↗pdf ↗

Circular nets with spherical parameter lines have geometric properties related to Darboux cyclides and terminating Laplace sequences.

problem Discretizing surfaces with spherical curvature lines.
method Lie-geometric discretisation in terms of principal contact element nets.
result Circular nets with two families of spherical parameter lines are related to Darboux cyclides.

Smart Close-out Netting aims to automate close-out netting processes.

problem Inefficiencies in close-out netting processes for financial institutions.
method Standardisation and automation of legal and regulatory processes using a data-driven framework and controlled natural language.
result Standardisation and automation can improve close-out netting processes for prudentially regulated financial institutions.

This paper considers the power of deep neural networks (deep nets for short) in realizing data features. Based on refined covering number estimates, we find that, to realize some complex data features, deep nets can improve the performances of shallow neural networks (shallow nets for short) without requiring additiona…

2019-01-01abs ↗pdf ↗

Supercyclides are surfaces with a characteristic conjugate parametrization consisting of two families of conics. Patches of supercyclides can be adapted to a Q-net (a discrete quadrilateral net with planar faces) such that neighboring surface patches share tangent planes along common boundary curves. We call the result…

2014-12-23abs ↗pdf ↗

Integrable nets described with curvature relations to pseudospherical surfaces.

problem Describing integrable curve nets and their geometric properties.
method Overview of second-order invariants, specific example of concordant nets, and construction of pseudospherical surfaces.
result Concordant Chebyshev nets correspond to pairs of pseudospherical surfaces.

We consider nn-dimensional discrete motions such that any two neighbouring positions correspond in a pure rotation ("rotating motions"). In the Study quadric model of Euclidean displacements these motions correspond to quadrilateral nets with edges contained in the Study quadric ("rotation nets"). The main focus of ou…

2010-04-08abs ↗pdf ↗

A geodesic net with 4 boundary vertices and 25 balanced vertices is constructed.

problem Constructing geodesic nets with specific vertex types and properties.
method Novel approach to increase the number of balanced vertices from 16 to 25.
result First net with four boundary vertices and 25 balanced vertices, including non-symmetric balanced vertices.

In this paper, we use replica analysis to determine the investment strategy that can maximize the net present value for portfolios containing multiple development projects. Replica analysis was developed in statistical mechanical informatics and econophysics to evaluate disordered systems, and here we use it to formula…

2018-10-15abs ↗pdf ↗

In this paper we establish a relationship between geodesic nets and critical points of the distance function. We bound the number of balanced points for certain minimizing geodesic nets on manifolds homeomorphic to the nn-sphere. We also bound the length of certain minimizing geodesic nets.

2019-05-17abs ↗pdf ↗

Geometric approach uses Bäcklund transformations to create integrable discrete analogs of surface nets.

problem Creating integrable discrete analogs of surface nets and conjugate nets.
method Interpreting classical differential geometry results through Bäcklund transformations and applying permutability properties.
result Integrable discrete analogs of asymptotic and conjugate nets are constructed.

We consider discrete nets in Grassmannians Grd\mathbb{G}^d_r which generalize Q-nets (maps ZNPd\mathbb{Z}^N\to\mathbb{P}^d with planar elementary quadrilaterals) and Darboux nets (Pd\mathbb{P}^d-valued maps defined on the edges of ZN\mathbb{Z}^N such that quadruples of points corresponding to elementary squares are all co…

2008-12-30abs ↗pdf ↗

U-Net trained to recover acoustic interference striations from distorted data.

problem Recovering acoustic interference striations from distorted signals.
method Training a U-Net using a random mode-coupling matrix model to generate training data.
result U-Net successfully recovers AISs under various conditions.

DP-Net uses dynamic programming for efficient deep neural network compression.

problem Efficiently compressing deep neural networks while maintaining accuracy.
method Dynamic Programming for optimal weight quantization and clustering-friendly training.
result Achieves up to 77X compression ratio on Wide ResNet with minimal accuracy loss.

An important class of distance metrics proposed for training generative adversarial networks (GANs) is the integral probability metric (IPM), in which the neural net distance captures the practical GAN training via two neural networks. This paper investigates the minimax estimation problem of the neural net distance ba…

2018-11-02abs ↗pdf ↗

Confocal conics form an orthogonal net. Supplementing this net with one of the following: 1) the net of Cartesian coordinate lines aligned along the principal axes of conics, 2) the net of Apollonian pencils of circles whose foci coincide with the foci of conics, 3) the net of tangents to a conic of the confocal family…

2019-12-04abs ↗pdf ↗

SDE-Net quantifies uncertainty in deep nets using stochastic dynamics.

problem Uncertainty quantification in deep neural networks.
method Viewing DNN transformations as state evolution of a stochastic dynamical system, introducing a Brownian motion term for epistemic uncertainty.
result SDE-Net outperforms existing methods in uncertainty estimation across various tasks.