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

305989118 · May 202619922001200920172026
48 results for Relative simplicity

The paper explores simple and relatively simple transformation groups and their universal coverings.

problem Understanding the structure of universal coverings of transformation groups.
method Study of relatively simple groups and generalization of Tsuboi's metric space.
result Tsuboi's metric space of Ham~(M,ω)\widetilde{\mathrm{Ham}}(M, ω) is not quasi-isometric to the half line.

We study a natural intrinsic definition of geometric simplices in Riemannian manifolds of arbitrary dimension nn, and exploit these simplices to obtain criteria for triangulating compact Riemannian manifolds. These geometric simplices are defined using Karcher means. Given a finite set of vertices in a convex set on t…

2014-06-14abs ↗pdf ↗

Finite index subgroups of relatively hyperbolic groups have equal index.

problem Finite index subgroups of relatively hyperbolic groups have equal index.
method Demonstrating that the number of simplices in a simplicial classifying space grows linearly with index.
result Finite index subgroups of relatively hyperbolic groups have equal index.

The recent crisis and the following flight to simplicity put most derivative businesses around the world under considerable pressure. We argue that the traditional modeling techniques must be extended to include product design. We propose a quantitative framework for creating products which meet the challenge of being …

2011-06-15abs ↗pdf ↗

In this paper, we present our general results about traversing flows on manifolds with boundary in the context of the flows on surfaces with boundary. We take advantage of the relative simplicity of 2D2D-worlds to explain and popularize our approach to the Morse theory on smooth manifolds with boundary, in which the bo…

2015-11-10abs ↗pdf ↗

Shellable tilings on simplicial complexes help understand their structure.

problem Understanding the structure of simplicial complexes through tilings.
method Proving the existence of shellable h-tilings on finite simplicial complexes after stellar subdivisions.
result The h-vector of a tiling is determined by the critical vector, with palindromic properties for closed triangulated manifolds.

The paper establishes conditions for Riemannian connections and semi-simplicity of Lie algebras using spray structures.

problem Conditions for Riemannian connections and semi-simplicity of Lie algebras.
method Using almost product structures and spray, the paper provides necessary and sufficient conditions for these properties.
result Equivalence of semi-simplicity of Lie algebras to derived ideal coincidence, interiority of derivations, and adjoint representation semi-simplicity.

Neural networks favor simple features over complex ones, even when complex features are available.

problem Neural networks exhibit a bias towards simple features over complex ones, even when complex features are present.
method Rigorously defined simplicity bias, theoretical and empirical demonstrations, ensemble approach to improve robustness.
result One hidden layer neural networks favor simple features over complex ones, even in the presence of more robust features.

Framework reduces simplicity bias in NNs, improving OOD generalization and robustness.

problem Simplicity bias in deep learning models leads to biased predictions and poor OOD generalization.
method Proposes a framework that regularizes conditional mutual information to encourage use of diverse features.
result Demonstrates effectiveness in various settings, enhancing OOD generalization and robustness.

New framework shows CC^*-simplicity for groups without certain subalgebras.

problem Characterizing CC^*-simplicity of groups.
method Introducing confined subalgebras and Uniformly Recurrent States.
result A countable discrete group is CC^*-simple if it has no non-trivial amenable confined subalgebras.

Research reveals simplicity bias in random logistic map, impacting data analysis and forecasting.

problem Simplicity bias in dynamical systems and its impact on data analysis and prediction.
method Examined the logistic map and random logistic map, focusing on simplicity bias and noise effects.
result Simplicity bias is observable in the random logistic map, persisting even with small noise levels.

The Apollonius theorem is generalized for m-simplices, with applications in geometry and optimization.

problem Generalizing the Apollonius theorem for m-simplices.
method Direct generalization of the theorem to m-simplices in n-dimensional space.
result Applications in geometry and optimization, including minimal surface enclosures, simplex thickness, and root-finding methods.

We propose the segmented iHMM (siHMM), a hierarchical infinite hidden Markov model (iHMM) that supports a simple, efficient inference scheme. The siHMM is well suited to segmentation problems, where the goal is to identify points at which a time series transitions from one relatively stable regime to a new regime. Conv…

2016-02-20abs ↗pdf ↗

We study prismatics sets analogously to simplical sets except that realization involves prisms, i.e., products of simplices rather than just simplices. Particular examples are the prismatic subdivision of a simplicial set S and the prismatic star of S. Both have the same homotopy type as S and in particular the latter …

2008-07-31abs ↗pdf ↗

We generalize the very well known boundary operator of the ordinary singular homology theory, defined in many books about algebraic topology. We describe a variant of this ordinary simplicial boundary operator where the usual boundary (n-1)-simplices of each n-simplex are replaced by combinations of internal (n-1)- sim…

2011-09-09abs ↗pdf ↗

Normal 4-pseudomanifolds with one or two singular vertices are derived from specific operations.

problem Understanding face-number invariants in normal 4-pseudomanifolds.
method Structural analysis and sequence of operations (vertex foldings, edge foldings, connected sums).
result Normal 4-pseudomanifolds with specific conditions can be derived from boundary complexes of 5-simplices.

The paper explores how simplicity leads to better out-of-distribution generalization in models.

problem Understanding the theoretical principles behind out-of-distribution (OOD) generalization in modern models.
method Examining diffusion models in image generation to analyze compositional generalization abilities and develop a theoretical framework for simplicity-based OOD generalization.
result The true, generalizable model corresponds to the simplest among consistent models, and this simplicity can be quantified and used to establish sample complexity guarantees.

The study reveals simplicity bias in neural networks leading to better compositional mappings.

problem Understanding when and how to encourage neural networks to learn compositional mappings.
method Examined compositional mappings through coding length and gradient descent dynamics.
result Neural networks tend to learn the simplest bijections, explaining their good generalization.

Study on simplicity of Lie skew braces, proving new results for compact cases.

problem Simplicity of Lie skew braces, focusing on compact connected cases.
method Reviewing correspondence, investigating ideals and rigidity, proving main result for compact Lie skew braces.
result Compact connected simple Lie skew braces are either trivial or have simple underlying Lie groups.

Two-layer networks favor simple features, especially in complex datasets.

problem Simplicity bias in neural networks over-reliing on simple features.
method Characterization of two-layer neural networks with small weights and gradient flow.
result Features learned in middle training stages are more useful for out-of-distribution transfer.

We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that are inspired by the ideas from toric topology.

2016-09-19abs ↗pdf ↗

Neural nets learn simple distributions first, then more complex ones.

problem Understanding how neural networks generalize from simple to complex functions.
method Stochastic gradient descent training, synthetic data, CIFAR10, ImageNet pre-training.
result Neural networks initially use lower-order statistics, then higher-order ones.

The paper proves eigenvalues are simple for specific operators on bundles.

problem Eigenvalue simplicity for connection Laplacian and GG-simplicity on bundles.
method Analyzes connections on vector bundles and principal bundles, proving eigenvalue simplicity for a residual set of connections.
result Eigenvalues of the connection Laplacian and Laplace-Beltrami operator are simple for specified conditions.

Everyone knows that the Euler characteristic of a combinatorial manifold is given by the alternating sum of its numbers of simplices. It is shown that there are other linear combinations of the numbers of simplices which are combinatorial invariants, but that all such invariants are multiples of the Euler characteristi…

2002-01-18abs ↗pdf ↗

The study improves representation learning bounds using data-dependent Gaussian mixtures.

problem Improving generalization in representation learning.
method Established bounds using relative entropy and MDL of latent variables.
result The approach significantly improves generalization over existing methods.

AB-testing is a very popular technique in web companies since it makes it possible to accurately predict the impact of a modification with the simplicity of a random split across users. One of the critical aspects of an AB-test is its duration and it is important to reliably compute confidence intervals associated with…

2015-01-30abs ↗pdf ↗

Study the boundary operator property on simplicial complexes, proving essential properties for Hodge theory.

problem Characterize the boundary operator property =0\partial\partial = 0 on simplicial complexes.
method Characterization in 2\ell^2 terms of recurrence of links, defining relative cohomology, and proving harmonic eigenforms.
result Essential properties for Hodge theory, including weak decomposition and existence of harmonic eigenforms.

In this paper, we give an algorithm to build all compact orientable atoroidal Haken 3-manifolds with tori boundary or closed orientable Haken 3-manifolds, so that in both cases, there are embedded closed orientable separating incompressible surfaces which are not tori. Next, such incompressible surfaces are related to …

2015-11-03abs ↗pdf ↗

Proves simplicity of Lyapunov exponents for specific Anosov flows.

problem Proving all Lyapunov exponents have multiplicity 1 for certain Anosov flows.
method Perturbative results for flows, modification of eigenvalues, Markov partition, and simplicity criterion.
result In a C1C^1-open and CkC^k-dense set of Anosov flows, all Lyapunov exponents have multiplicity 1.

This paper proposes a new method for efficient data compression using Bayesian neural networks.

problem Efficient compression of data represented as functions mapping coordinates to signal values.
method Overfitting variational Bayesian neural networks to the data and compressing an approximate posterior weight sample using relative entropy coding.
result Our method achieves strong performance on image and audio compression while retaining simplicity.