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

146292438584 · Jun 202019922001200920172026
48 results for parametrized topological complexity

The article applies Lusternik-Schnirelmann theory to establish lower bounds on critical points using sequential and parametrized topological complexity.

problem Establishing lower bounds on the number of critical points of functions using topological complexity.
method Applying Lusternik-Schnirelmann theory to sequential and parametrized topological complexity.
result Established various lower bounds on the number of critical points using sequential and parametrized topological complexity.

This paper introduces a new method for neural networks that doesn't need a global coordinate system.

problem The lack of a global coordinate system in neural networks limits their performance and explainability.
method Proposes a learnable topological layer that works in a general metric space (Hilbert space) without requiring a Euclidean space.
result The proposed method eliminates the need for a costly parametrization stage and achieves optimal network performance.

PERCEPT detects changes in high-dimensional data streams using topological data analysis.

problem Detecting changes in high-dimensional data streams, especially when embedded in a low-dimensional space.
method Leverages topological data analysis to learn embedded topology as a point cloud via persistence diagrams, then applies non-parametric monitoring for detecting changes.
result Demonstrates efficient detection of online changes from high-dimensional data streams.

Study new bounds on TC of spaces with subgroup inclusions.

problem Lower bounds on TC of spaces with subgroup inclusions.
method Generalizes TC results from aspherical spaces to spaces with subgroup inclusions.
result Establishes new lower bounds on sequential TCs of aspherical spaces.

This paper proposes a new method for learning covers of geometric datasets to improve topological inference and visualization.

problem Improving topological inference and visualization of large-scale geometric datasets.
method Proposes a method for learning topologically-faithful covers of geometric datasets using optimization.
result Simplicial complexes obtained from learned covers outperform standard methods in terms of size and representation of large-scale topology.

We construct an invariant of parametrized generic real algebraic surfaces in RP^3 which generalizes the Brown invariant of immersed surfaces from smooth topology. The invariant is constructed using the self intersection, which is a real algebraic curve with points of three local characters: the intersection of two real…

2011-08-07abs ↗pdf ↗

In the compressive learning theory, instead of solving a statistical learning problem from the input data, a so-called sketch is computed from the data prior to learning. The sketch has to capture enough information to solve the problem directly from it, allowing to discard the dataset from the memory. This is useful w…

2019-10-22abs ↗pdf ↗

New framework combines simple machines into complex ones for better neural network performance.

problem Improving neural network performance with limited training data.
method Developed a framework using topology and functional analysis to combine simple machines into complex ones, and used kernel methods to find optimal architectures.
result Kernel-inspired networks can outperform classical neural networks when training data is small.

We give a new proof of an index theorem for fiber bundles of compact topological manifolds due to Dwyer, Weiss, and Williams, which asserts that the parametrized AA-theory characteristic of such a fiber bundle factors canonically through the assembly map of AA-theory. Furthermore our main result shows a refinement of…

2019-05-06abs ↗pdf ↗

This paper proves a conjecture of Fomin and Shapiro that their combinatorial model for any Bruhat interval is a regular CW complex which is homeomorphic to a ball. The model consists of a stratified space which may be regarded as the link of an open cell intersected with a larger closed cell, all within the totally non…

2007-11-08abs ↗pdf ↗

Researchers parametrize spaces of positive representations for Lie groups.

problem Tackling spaces of positive representations for Lie groups.
method Generalizing Lusztig's total positivity, they introduce spaces of positive framed representations and parametrize them.
result The number of connected components of the space of framed positive representations agrees with the number of positive representations.

Modeling structure in complex networks using Bayesian non-parametrics makes it possible to specify flexible model structures and infer the adequate model complexity from the observed data. This paper provides a gentle introduction to non-parametric Bayesian modeling of complex networks: Using an infinite mixture model …

2013-12-20abs ↗pdf ↗

We give a local parametric description of all holomorphic hypersurfaces in complex Euclidean and projective spaces with constant index of relative nullity, together with applications. This is a complex analogue to the parametrization for real hypersurfaces in Euclidean space known as the Gauss parametrization.

2008-09-04abs ↗pdf ↗

We study the topological configurations of the lines of principal curvature, the asymptotic and characteristic curves on a cuspidal edge, in the domain of a parametrization of this surface as well as on the surface itself. Such configurations are determined by the 3-jets of a parametrization of the surface.

2017-03-27abs ↗pdf ↗

We study the topology of a space parametrizing stable tropical curves of genus g with volume 1, showing that its reduced rational homology is canonically identified with both the top weight cohomology of M_g and also with the genus g part of the homology of Kontsevich's graph complex. Using a theorem of Willwacher rela…

2018-05-25abs ↗pdf ↗

We present an approach of computing the intersection curve C\mathcal{C} of two rational parametric surface §1(u,s)§_1(u,s) and §2(v,t)§_2(v,t), one being projectable and hence can easily be implicitized. Plugging the parametric surface to the implicit surface yields a plane algebraic curve G(v,t)=0G(v,t)=0. By analyzing the topology …

2012-03-02abs ↗pdf ↗

Examines algorithmic modeling across three cultures.

problem Tackles algorithmic modeling in different cultural contexts.
method Uses parametric regressions, interpretable algorithms, and complex algorithms.
result Extension of Leo Breiman's thesis to include cultural differences.

This survey reviews dimension estimation methods for datasets.

problem Understanding the intrinsic dimension of high-dimensional datasets.
method Categorizes dimension estimation methods by geometric information: tangential, parametric, and topological.
result Many dimension estimation methods may overfit and not generalize well.

Unified analysis for decentralized SGD across various topologies and updates.

problem Analysis of decentralized SGD methods with changing topologies and local updates.
method Unified convergence analysis covering local SGD updates and adaptive network topology.
result Universal convergence rates for smooth problems, interpolating between heterogeneous and iid-data settings.

A new Helmholtzian operator from point clouds for flow analysis.

problem Analyzing flows and vector fields on manifolds from point cloud data.
method Estimation of manifold Helmholtzian from point cloud data using weighted 1-Laplacian.
result The Helmholtzian operator L1\mathcal L_1 effectively smooths, predicts, and extracts features from flows on manifolds.

A semi-parametric, non-linear regression model in the presence of latent variables is applied towards learning network graph structure. These latent variables can correspond to unmodeled phenomena or unmeasured agents in a complex system of interacting entities. This formulation jointly estimates non-linearities in the…

2018-06-28abs ↗pdf ↗

Study the topology of stable vector fields and Lyapunov functions on R^n.

problem Topology of stable vector fields and Lyapunov functions on R^n.
method Differential topology, Lyapunov theory, and results on diffeomorphism groups of discs.
result Path-connected and simply connected spaces of stable vector fields for n≠4,5 and weakly contractible for n≤3.

We consider decomposition spaces R3/G\R^3/G that are manifold factors and admit defining sequences consisting of cubes-with-handles. Metrics on R3/G\R^3/G constructed via modular embeddings into Euclidean spaces promote the controlled topology to a controlled geometry. The quasisymmetric parametrizability of the metric spa…

2011-11-09abs ↗pdf ↗

Let EE be a closed set in the Riemann sphere C^\widehat{\mathbb{C}}. We consider a holomorphic motion φφ of EE over a complex manifold MM, that is, a holomorphic family of injections on EE parametrized by MM. It is known that if MM is the unit disk ΔΔ in the complex plane, then any holomorphic motion of EE ove…

2017-09-22abs ↗pdf ↗

Proposes SGM for modeling complex dependencies in high-dimensional systems.

problem Limited pairwise interactions in PGMs for high-dimensional systems.
method Simplicial Gaussian model (SGM) using discrete Hodge theory and independent random components.
result Maximum-likelihood inference algorithm for parameter recovery and conditional dependence structure.

The study proves a strong parametric h-principle for minimal surfaces.

problem Proving a parametric h-principle for minimal surfaces.
method Using a parametric h-principle due to Forstneric and Larusson.
result The space of complete nonflat conformal minimal immersions has the same homotopy type as the space of continuous maps.

Formulates superhedging under costs and uncertainty for continuous assets.

problem Superhedging with transaction costs and model uncertainty for continuous processes.
method New topological framework for continuous asset prices with parametric model uncertainty.
result Formulates a superhedging theorem in the presence of transaction costs and model uncertainty.

The parametrization theorem is derived in a flat nD pseudo-complex affine space. The pseudo-complex hyperbolic space accomodates n-number of uncompactified time-like extra dimensions with sugnature (s,r), where s and r are the numbers of minus and plus signs associated with the diagonalized metric matrix. The main resu…

2010-03-01abs ↗pdf ↗

Modular curves X1(N)X_{1}(N) parametrize elliptic curves with a point of order NN. They can be identified with connected components of projectivized strata PH(a,a)\mathbb{P}\mathcal{H}(a,-a) of meromorphic differentials. As strata of meromorphic differentials, they have a canonical walls-and-chambers structure defined by the …

2017-10-23abs ↗pdf ↗

We describe a graph parametrization of rational quadratic differentials with presence of a simple pole, whose critical trajectories form a network depending on parameters focusing on the network topological jumps. Obtained bifurcation diagrams are associated with the Stasheff polytopes.

2015-09-02abs ↗pdf ↗

We discuss the issue of branching in quasiregular mapping, and in particular the relation between branching and the problem of finding geometric parametrizations for topological manifolds. Other recent progress and open problems of a more function theoretic nature are also presented.

2003-04-22abs ↗pdf ↗

Paper shows faster convergence to local-minimizers in over-parametrized models under interpolation-like conditions.

problem Escaping saddle-points in over-parametrized models.
method Stochastic and deterministic optimization algorithms under interpolation-like conditions.
result Oracle complexity of PSGD and SCRN algorithms to reach εε-local-minimizer matches or improves upon deterministic rates.

The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function of the Fisher information volume of the model as the sample size nn goes to in…

2015-10-01abs ↗pdf ↗

Two-dimensional conformally parametrized surfaces immersed in the su(N) algebra are investigated. The focus is on surfaces parametrized by solutions of the equations for the CP^(N-1) sigma model. The Lie-point symmetries of the CP^(N-1) model are computed for arbitrary N. The Weierstrass formula for immersion is determ…

2007-10-24abs ↗pdf ↗

New calculations of topological complexity for symplectic CW-complexes.

problem Calculating topological complexity for symplectic CW-complexes.
method Using atoroidal cohomology classes and CW-complexes, proving topological complexity for symplectic spaces.
result Every atoroidally symplectic CW-complex of dimension 2n has topological complexity 4n.

The paper explores conditions for topological rigidity in quotients of the Davis complex.

problem Understanding when quotients of the Davis complex are topologically rigid.
method Analyzing quotients of the Davis complex of right-angled Coxeter groups and conditions on defining graphs.
result Introduction of infinitely many infinite topologically rigid subclasses.

The Mutual Information (MI) is an often used measure of dependency between two random variables utilized in information theory, statistics and machine learning. Recently several MI estimators have been proposed that can achieve parametric MSE convergence rate. However, most of the previously proposed estimators have th…

2018-01-27abs ↗pdf ↗

Let f:S1Rf:S^1\to R be a generic map. We may use ff to define a new map f~:S1R3\tilde{f}:S^1\to R^3 by f~(t)=(f(t),f(t),f(t))\tilde{f}(t) = (-f(t),f'(t),-f''(t)), and if ff is an embedding then the image of f~\tilde{f} will be a knot. Knots defined by such parametrizations are called holonomic knots. They were introduced in 1997 by Vassiliev, w…

1998-10-05abs ↗pdf ↗