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

14274154 · Jun 202019922001200920172026
48 results for attracting

Neighbor embeddings balance attraction and repulsion to visualize data.

problem Visualizing high-dimensional datasets with trade-offs between continuous and discrete structures.
method Neighbor embeddings combine attractive and repulsive forces to visualize data.
result Changing the exaggeration parameter in t-SNE yields a spectrum of embeddings with a trade-off between continuous and discrete structures.

Proves properties of neural network basins of attraction and their expressiveness.

problem Characterize the properties of basins of attraction in neural networks.
method Analyzes width-bounded neural networks, proving properties of basins of attraction.
result Boundedness and path-connectedness of basins of attraction under certain conditions.

Proposes a method to learn system dynamics and region of attraction from trajectories.

problem Learning accurate dynamics and region of attraction from system trajectories.
method Uses local stability information as a prior to learn vector field and region of attraction.
result Efficient sampling and accurate estimate of dynamics in inner approximation of region of attraction.

ARS visualization improves t-SNE dynamics with tunable attraction and repulsion.

problem Improve data visualization techniques for complex data sets.
method ARS framework based on t-SNE dynamics with normalized interactions and tunable kernels.
result ARS visualization provides better control over cluster tightness and spacing.

Straight lines are a basin of attraction for the elastic flow at least to level 1.9615π.

problem Understanding the basin of attraction for the free boundary free elastic flow.
method Steepest descent gradient flow for elastic energy, numerical evidence.
result Straight lines have a basin of attraction at least to level 1.9615π.

Given a free group FnF_n, a fully irreducible automorphism $f \in \aut$, and a generic element xFnx \in F_n, the elements fk(x)f^k(x) converge in the appropriate sense to an object called an attracting lamination of ff. When the action of ff on Fn[Fn,Fn]\frac{F_n}{[F_n, F_n]} has finite order, we introduce a homological version…

2013-05-07abs ↗pdf ↗

We investigate how the choice of decision makers can be varied under the presence of risk and uncertainty. Our analysis is based on the approach we have previously applied to individual decision makers, which we now generalize to the case of decision makers that are members of a society. The approach employs the mathem…

2014-09-02abs ↗pdf ↗

Study on existence of ground states on curved spaces with conditions on potential growth.

problem Existence of ground states for aggregation-diffusion models on Cartan-Hadamard manifolds.
method Investigation of a free energy functional on Cartan-Hadamard manifolds, considering entropy and interaction energies.
result Necessary and sufficient conditions for existence of ground states are found, depending on the growth of the attractive potential.

Hidden regular variation is a sub-model of multivariate regular variation and facilitates accurate estimation of joint tail probabilities. We generalize the model of hidden regular variation to what we call hidden domain of attraction. We exhibit examples that illustrate the need for a more general model and discuss de…

2011-10-04abs ↗pdf ↗

Researchers identify valid auxiliary functions for extreme value distributions and their max-domains of attraction.

problem Characterize valid auxiliary functions for extreme value distributions and their max-domains of attraction.
method Introduced 'universal' auxiliary functions valid for both VR and vMR representations, identified sets of valid auxiliary functions, and proposed a method for finding appropriate auxiliary functions.
result Characterized valid auxiliary functions for both VR and vMR representations for the entire MDA distribution families.

Most recommender systems recommend a list of items. The user examines the list, from the first item to the last, and often chooses the first attractive item and does not examine the rest. This type of user behavior can be modeled by the cascade model. In this work, we study cascading bandits, an online learning variant…

2016-03-17abs ↗pdf ↗

Motivated by applications to insurance mathematics, we prove some heavy-traffic limit theorems for processes which encompass the fractionally differentiated random walk as well as some FARIMA processes, when the innovations are in the domain of attraction of a nonGaussian stable distribution.

2011-02-19abs ↗pdf ↗

PoEL protocol aims to efficiently create and secure liquidity for blockchain networks.

problem Lack of sustainable liquidity and network security in Proof of Stake blockchains.
method PoEL uses staking rewards to attract risk capital, structuring incentives for capital efficiency and security.
result PoEL protocol enhances blockchain network security and liquidity sustainability.

This paper analyses the relationship between BitCoin price and supply-demand fundamentals of BitCoin, global macro-financial indicators and BitCoin attractiveness for investors. Using daily data for the period 2009-2014 and applying time-series analytical mechanisms, we find that BitCoin market fundamentals and BitCoin…

2014-05-18abs ↗pdf ↗

The study proves a theorem about subword complexity for free group automorphisms.

problem Analyzing subword complexity for attracting fixed points of automorphisms of free groups.
method Combinatorial arguments and train tracks.
result Subword complexity of attracting fixed points is equivalent to n, n log log n, n log n, or n^2.

Study fixed point indices and words at infinity for graph selfmaps.

problem Estimate indices of fixed point classes for graph selfmaps.
method Extend attracting fixed words at infinity, use relative train track technique, algebraic approach.
result Upper bound for attracting fixed words of injective endomorphisms of free groups.

Enhances contrastive learning for better representation learning on wild images.

problem Binary partition of views from same and different instances limits CL's performance.
method Doubly Contrastive Learning (CACR) with contrastive attraction and repulsion.
result CACR improves performance and robustness on wild image datasets.

New method finds basins of attraction without needing system models.

problem Determining basins of attraction (BoA) for nonlinear systems without prior knowledge.
method Hybrid Active Learning (HAL) method combining AST, AL, and DBS.
result Efficiently finds and labels boundary of BoA without model knowledge.

Loss functions with a large number of saddle points are one of the major obstacles for training modern machine learning models efficiently. First-order methods such as gradient descent are usually the methods of choice for training machine learning models. However, these methods converge to saddle points for certain ch…

2019-01-21abs ↗pdf ↗

A bipartite producer-consumer network is constructed to describe the industrial structure. The edges from consumer to producer represent the choices of the consumer for the final products and the degree of producer can represent its market share. So the size distribution of firms can be characterized by producer's degr…

2005-07-21abs ↗pdf ↗

Compactifies geodesic flows on hyperbolic surfaces, revealing attractive circles at infinity.

problem Geodesic flows on non-compact hyperbolic surfaces without cusps.
method Constructs a geometrical compactification using one-dimensional distributions tangent to stable and unstable horocycles.
result Existence of attractive circles at infinity in the compactified flow.

ICLR 2021 challenge in computational geometry and topology attracted 16 teams.

problem Designing and evaluating computational methods in differential geometry and topology.
method Designing and hosting an open-source competition with repositories Geomstats and Giotto-TDA.
result 16 teams participated in the challenge, showcasing innovative contributions to computational geometry and topology.

We introduce a new model for online ranking in which the click probability factors into an examination and attractiveness function and the attractiveness function is a linear function of a feature vector and an unknown parameter. Only relatively mild assumptions are made on the examination function. A novel algorithm f…

2018-10-05abs ↗pdf ↗

Study ping-pong dynamics in hyperbolic-like groups with non-simple points.

problem Investigate the ping-pong dynamics of hyperbolic-like groups.
method Explicitly provide a proper ping-pong partition for any pair of non-cyclic point stabilizers.
result Existence of a proper ping-pong partition for any pair of non-cyclic point stabilizers.

We consider the problem of diversity enhancing clustering, i.e, developing clustering methods which produce clusters that favour diversity with respect to a set of protected attributes such as race, sex, age, etc. In the context of fair clustering, diversity plays a major role when fairness is understood as demographic…

2019-04-10abs ↗pdf ↗

GCAO improves clustering of high-dimensional data by grouping low-density boundary points.

problem Stability and accuracy of clustering in high-dimensional, non-uniform data.
method Group-level optimization with gravitational attraction and optimization.
result GCAO outperforms 11 clustering methods on multiple datasets.

Study on consensus formation in manifolds with curvature constraints.

problem Long-time behavior of solutions to nonlocal PDEs on Riemannian manifolds.
method Analytical and numerical methods applied to self-collective models.
result Sufficient conditions for consensus formation and convergence rates quantified.

The paper defines a path metric on a stable component of polynomial families.

problem Understanding the geometry of polynomial families with parabolic relations.
method Constructing a positive semi-definite pressure form on a bounded stable component of the moduli space.
result The pressure form defines a path metric on the stable component.

We consider the class of convex minimization problems, composed of a self-concordant function, such as the logdet\log\det metric, a convex data fidelity term h()h(\cdot) and, a regularizing -- possibly non-smooth -- function g()g(\cdot). This type of problems have recently attracted a great deal of interest, mainly due to th…

2014-05-13abs ↗pdf ↗

This master thesis focuses on practical application of Convolutional Neural Network models on the task of road labeling with bike attractivity score. We start with an abstraction of real world locations into nodes and scored edges in partially annotated dataset. We enhance information available about each edge with pho…

2018-06-27abs ↗pdf ↗

Framework analyzes neural network dynamics for better understanding and optimization.

problem Understanding the fundamental mechanisms of deep neural networks.
method Dynamical systems theory, transformation units, attraction basins.
result Different transformation modes lead to distinct learning phases and network performance.

Topological surgery occurs in natural phenomena where two points are selected and attracting or repelling forces are applied. The two points are connected via an invisible `thread'. In order to model topologically such phenomena we introduce dynamics in 1-, 2- and 3-dimensional topological surgery, by means of attracti…

2014-06-04abs ↗pdf ↗

High-fee pools attract more liquidity but execute less volume; low-fee pools have more stable LPs.

problem Optimal liquidity supply and execution on decentralized exchanges with fixed gas costs.
method Analysis of Uniswap data to compare high- and low-fee pools.
result Fragmented liquidity leads to more LPs and competition, improving overall market efficiency.