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

6.3%12.5%18.8%25.0% · Mar 199319922001200920172026
48 results for cone nets

We propose convex relaxations for convolutional neural nets with one hidden layer where the output weights are fixed. For convex activation functions such as rectified linear units, the relaxations are convex second order cone programs which can be solved very efficiently. We prove that the relaxation recovers the glob…

2018-12-31abs ↗pdf ↗

We adapt the method of Simon [JDG '93] to prove a C1,αC^{1,α}-regularity theorem for minimal varifolds which resemble a cone C02\bf{C}_0^2 over an equiangular geodesic net. For varifold classes admitting a "no-hole" condition on the singular set, we additionally establish C1,αC^{1,α}-regularity near the cone $\bf{C}_0^2 \ti…

2017-09-28abs ↗pdf ↗

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 ↗

Given a closed orientable Euclidean cone 3-manifold C with cone angles less than or equal to pi, and which is not almost product, we describe the space of constant curvature cone structures on C with cone angles less than pi. We establish a regeneration result for such Euclidean cone manifolds into spherical or hyperbo…

2005-10-20abs ↗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.

For 3-dimensional hyperbolic cone structures with cone angles θθ, local rigidity is known for 0θ2π0 \leq θ\leq 2π, but global rigidity is known only for 0θπ0 \leq θ\leq π. The proof of the global rigidity by Kojima is based on the fact that hyperbolic cone structures with cone angles at most ππ do not degenerate in defo…

2019-09-14abs ↗pdf ↗

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.

The SCMU algorithm computes cone factorizations for symmetric cones, improving upon existing methods.

problem Computing cone factorizations for symmetric cones in optimization.
method Introduces and analyzes the symmetric-cone multiplicative update (SCMU) algorithm.
result The SCMU algorithm non-decreases the squared loss objective.

Study examines how business units can benefit from group cohesion under regulatory constraints.

problem Regulatory constraints limit business units' ability to form a single cohesive group.
method Defined and analyzed cohesive risk measures to minimize capital costs.
result Cohesive risk measures allow groups to achieve minimal capital costs without altering individual liabilities.

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 ↗

We describe some properties of noncompact Euclidean cone manifolds with cone angles less than c less than 2pi and singular locus a submanifold. More precisely, we describe its structure outside a compact set. As a corollary we classify those with cone angles less than 3pi/2 and those with all cone angles equal to 3pi/2…

2009-04-08abs ↗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.