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,982 papers · 148 categories

Trend · papers per month

109219328437 · Jun 202019922001200920172026
48 results for linear part

This survey consists of two parts. Part 1 is devoted to amoebas. These are images of algebraic subvarieties in the complex torus under the logarithmic moment map. The amoebas have essentially piecewise-linear shape if viewed at large. Furthermore, they degenerate to certain piecewise-linear objects called tropical vari…

2004-02-29abs ↗pdf ↗

Properly discontinuous actions of a surface group by affine automorphisms of Rd\mathbb R^d were shown to exist by Danciger-Gueritaud-Kassel. We show, however, that if the linear part of an affine surface group action is in the Hitchin component, then the action fails to be properly discontinuous. The key case is that o…

2018-12-10abs ↗pdf ↗

In a paper with Jean-Paul Dufour in 1999 \cite{DufourZung-Nambu1999}, we gave a classification of linear Nambu structures, and obtained linearization results for Nambu structures with a nondegenerate linear part. There was a case left open in \cite{DufourZung-Nambu1999}, namely the case of smooth linearization of Nambu…

2012-01-11abs ↗pdf ↗

Following the programme set out in Part I of this work, we develop a conceptual higher order differential calculus. The '' local linear algebra '' defined in Part I is generalized by '' higher order local linear algebra ''. The underlying combinatorial object of such higher algebra is the natural n-dimensional hyper-cu…

2015-10-12abs ↗pdf ↗

We study the Ollivier-Ricci curvature of graphs as a function of the chosen idleness. We show that this idleness function is concave and piecewise linear with at most 33 linear parts, with at most 22 linear parts in the case of a regular graph. We then apply our result to show that the idleness function of the Cartes…

2017-04-14abs ↗pdf ↗

Study Poisson cohomology and linearize Lie algebra structures.

problem Linearize Poisson structures on sl2(C)\mathfrak{sl}_2(\mathbb{C}).
method Calculate Poisson cohomology, construct homotopy operators, develop Nash-Moser method.
result Show that Poisson structures linearizable at zero are flat.

The Margulis invariant is a function defined on a group of Lorentzian transformations GG acting on Minkowski space R2,1\R^{2,1}, that contains no elliptic elements. The spectrum of GG is the sequence of values of the Margulis invariant for all its elements. If the underlying linear group of GG is fixed, Drumm and Gold…

2003-10-29abs ↗pdf ↗

We give a covering number bound for deep learning networks that is independent of the size of the network. The key for the simple analysis is that for linear classifiers, rotating the data doesn't affect the covering number. Thus, we can ignore the rotation part of each layer's linear transformation, and get the coveri…

2017-11-02abs ↗pdf ↗

This survey paper contains an elementary exposition of Casson and Rivin's technique for finding the hyperbolic metric on a 3-manifold M with toroidal boundary. We also survey a number of applications of this technique. The method involves subdividing M into ideal tetrahedra and solving a system of gluing equations to f…

2010-04-03abs ↗pdf ↗

CANN models improve insurance claim count predictions using telematics data.

problem Improving insurance claim count predictions with telematics data.
method Combining classical actuarial models with neural networks for telematics data.
result CANN models outperform traditional models in predicting insurance claims.

We show the existence of a thick thin decomposition of the domain of a pseudo holomorphic curve with boundary. The geometry of the thick part is bounded uniformly in the energy. Furthermore, in the thick part, there is a uniform bound on the differential which is exponential in the energy. The thin part consists of ann…

2013-11-29abs ↗pdf ↗

We prove an equivariant version of the local splitting theorem for tame Poisson structures and Poisson actions of compact Lie groups. As a consequence, we obtain an equivariant linearization result for Poisson structures whose transverse structure has semisimple linear part of compact type.

2005-10-25abs ↗pdf ↗

Paper shows linear convergence of ISTA and FISTA for ill-conditioned images.

problem Solving linear inverse problems with sparse representation in signal and image processing.
method Revisits iterative shrinkage-thresholding algorithms (ISTA) and improves their convergence properties.
result Linear convergence of ISTA and FISTA for strongly convex smooth parts, even in ill-conditioned cases.

Paper introduces a new method to solve complex PDEs efficiently.

problem Solving high-dimensional semilinear PDEs and BSDEs.
method Decomposes PDEs into linear and nonlinear parts, uses Deep BSDE solver with control variate method.
result Errors of the new method are much smaller than those of the original Deep BSDE solver.

We present three equivalent definitions of S1S^1-equivariant symplectic homology. We show that, using rational coefficients, the positive part of S1S^1-equivariant symplectic homology is isomorphic to linearized contact homology, when the latter is defined. We present several computations and applications, and introduc…

2012-12-15abs ↗pdf ↗

In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and the non-smooth part is equipped with a simple proximal mapping. We propose a pr…

2016-01-31abs ↗pdf ↗

Paper explores how unsupervised learning can be understood through linear algebra concepts.

problem Understanding unsupervised learning through linear algebra concepts.
method Introducing the concept of linearly independent populations and using them to solve for prevalence values.
result Unsupervised learning can be realized as a generalization of supervised learning.

We learn sensor trees from training data to minimize sensor acquisition costs during test time. Our system adaptively selects sensors at each stage if necessary to make a confident classification. We pose the problem as empirical risk minimization over the choice of trees and node decision rules. We decompose the probl…

2015-09-09abs ↗pdf ↗

Given an affine isometry of R3\R^3 with hyperbolic linear part, its Margulis invariant measures signed Lorentzian displacement along an invariant spacelike line. In order for a group generated by hyperbolic isometries to act properly on R3\R^3, the sign of the Margulis invariant must be constant over the group. We show…

2003-11-04abs ↗pdf ↗

This paper has three parts. The first part is a general introduction to rigidity and to rigid actions of mapping class group actions on various spaces. In the second part, we describe in detail four rigidity results that concern actions of mapping class groups on spaces of foliations and of laminations, namely, Thursto…

2014-07-22abs ↗pdf ↗

Simpler GNNs perform well on graph classification tasks.

problem Understanding what Graph Neural Networks (GNNs) learn and their complexity.
method Dissected GNNs into graph filtering and set function, linearizing them separately.
result Linear graph filtering with non-linear set function is efficient and powerful.

Study cost-driven state representation learning for control from partial observations.

problem Learning state representation for control from partial and high-dimensional observations.
method Cost-driven state representation learning via predicting cumulative costs.
result Established finite-sample guarantees for near-optimal representation and controller.

Study learns state representations from observations for control, proving guarantees.

problem Learning state representations from high-dimensional observations for control.
method Cost-driven approach, learning latent state model to predict costs.
result Proves finite-sample guarantees for near-optimal state representation and controller.

The aim of this paper is to generalize the theory of nonlinear connections of Grifone ([3] and [4]). We adopt the point of view of Anona [1] and continue developing the approach established by the first author in [10]. The first part of the work is devoted to the problem of associating to each LL-regular linear connec…

2006-08-13abs ↗pdf ↗

We tackle causal discovery in linear systems with measurement error and unobserved causes.

problem Causal discovery in linear systems with measurement error and unobserved causes.
method Characterization of identifiability based on the mixing matrix, proposing causal structure learning methods.
result The structure of causal models can be identified under certain faithfulness assumptions.

These are lecture notes for a course on machine learning with neural networks for scientists and engineers that I have given at Gothenburg University and Chalmers Technical University in Gothenburg, Sweden. The material is organised into three parts: Hopfield networks, supervised learning of labeled data, and learning …

2019-01-17abs ↗pdf ↗