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

6481,2961,9442,592 · Jun 202019922001200920172026
48 results for region of attraction

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.

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 ↗

Analyzes how learning algorithms affect and are affected by data manipulation.

problem Characterizing the closed-loop behavior of learning algorithms in the presence of decision-dependent data.
method Analyzes repeated risk minimization as perturbed gradient flows of performative risk minimization, considering multiple local minimizers.
result Characterizes the region of attraction for various equilibria and introduces performative alignment.

In this paper, we investigate the geometry of a general class of gradient flows with multiple local maxima. we decompose the underlying space into disjoint regions of attraction and establish the adjacency criterion. The criterion states a necessary and sufficient condition for two regions of attraction of stable equil…

2014-12-21abs ↗pdf ↗

The study estimates the expressiveness of GCNs with bounds on the number of linear regions.

problem Characterizing the expressiveness of graph convolutional networks (GCNs).
method Estimates the number of linear regions for one-layer and multi-layer GCNs.
result GCNs with multiple layers have exponentially more expressivity per parameter than one-layer GCNs.

With the recent advances in complex networks theory, graph-based techniques for image segmentation has attracted great attention recently. In order to segment the image into meaningful connected components, this paper proposes an image segmentation general framework using complex networks based community detection algo…

2019-07-04abs ↗pdf ↗

Stochastic partition models divide a multi-dimensional space into a number of rectangular regions, such that the data within each region exhibit certain types of homogeneity. Due to the nature of their partition strategy, existing partition models may create many unnecessary divisions in sparse regions when trying to d…

2019-03-10abs ↗pdf ↗

Density mode clustering is a nonparametric clustering method. The clusters are the basins of attraction of the modes of a density estimator. We study the risk of mode-based clustering. We show that the clustering risk over the cluster cores --- the regions where the density is high --- is very small even in high dimens…

2015-05-03abs ↗pdf ↗

Paper presents neural network controllers for offset-free setpoint tracking.

problem Offset-free setpoint tracking using neural network controllers.
method Exploiting slope-restricted activation functions, linear matrix inequalities are used to verify stability.
result Global and local stability conditions for neural network controllers are derived.

In this paper, we propose a new fuzzy clustering algorithm based on the mode-seeking framework. Given a dataset in Rd\mathbb{R}^d, we define regions of high density that we call cluster cores. We then consider a random walk on a neighborhood graph built on top of our data points which is designed to be attracted by hig…

2014-06-27abs ↗pdf ↗

Proposes a method to solve deep neural networks' local minimum problem.

problem Local minimum problem in deep neural networks training.
method Transforms cross-entropy loss into risk-averse error criterion, adjusts RSI, and uses convexity region.
result Trained deep learning machine is expected to be inside a global minimum's attraction basin.

The Prytz planimeter is a simple example of a system governed by a non-holonomic constraint. It is unique among planimeters in that it measures something more subtle than area, combining the area, centroid and other moments of the region being measured, with weights depending on the length of the planimeter. As a tool …

1998-08-16abs ↗pdf ↗

Safe RL for autonomous vehicles using PCPO with trust regions and parallel learners.

problem Unexplainable behaviours and lack of safety guarantees in RL for real vehicles.
method PCPO framework with trust regions and parallel learners.
result Safe learning confirmed for autonomous vehicles with fast convergence.

A new method selects regions of interest in GC-MS data without prior target selection.

problem Challenges in GC-MS data analysis due to fragmentation and shared fragment ions.
method Uses a pseudo F-ratio moving window (ψψFRMV) to automatically select regions of interest.
result Algorithm can accurately identify signal regions in GC-MS data.

We develop a new approach to the existence of time functions on Lorentzian manifolds, based on Conley's work regarding Lyapunov functions for dynamical systems. We recover Hawking's result that a stably causal admits a time function through a more general result giving the existence of a continuous function that is non…

2016-03-22abs ↗pdf ↗

Adaptive optimal control using value iteration (VI) initiated from a stabilizing policy is theoretically analyzed in various aspects including the continuity of the result, the stability of the system operated using any single/constant resulting control policy, the stability of the system operated using the evolving/ti…

2014-12-17abs ↗pdf ↗

The paper analyzes MENA region's energy consumption and policy needs for renewable energy.

problem High dependency on oil and low renewable energy penetration in MENA region.
method Analysis of World Bank datasets and policy portfolio in MENA countries.
result MENA region has high potential for solar energy but faces challenges in decoupling economic growth from energy consumption.

We consider the minimization of non-convex functions that typically arise in machine learning. Specifically, we focus our attention on a variant of trust region methods known as cubic regularization. This approach is particularly attractive because it escapes strict saddle points and it provides stronger convergence gu…

2017-05-16abs ↗pdf ↗

This thesis attempts to contribute to the study of differentiable dynamics both from a semi-local and global point of view. The center of study is differentiable dynamics in manifolds of dimension 3 where we are interested in the understanding of the existence and structure of attractors as well as dynamical and topolo…

2012-07-07abs ↗pdf ↗

Generalizing previous work by two of us, we prove the non-existence of certain stationary configurations in General Relativity having a spatial reflection symmetry across a non-compact surface disjoint from the matter region. Our results cover cases such that of two symmetrically arranged rotating bodies with anti-alig…

2009-07-07abs ↗pdf ↗

Study of circle arrangements related to Morse-Bott functions.

problem Understanding the geometry and singularity theory of Morse-Bott functions.
method Systematic construction of circle arrangements centered at existing circles, studying local changes in Reeb graphs.
result Reeb graphs of Morse-Bott functions are spaces of all components of preimages of single points.

The two most extended density-based approaches to clustering are surely mixture model clustering and modal clustering. In the mixture model approach, the density is represented as a mixture and clusters are associated to the different mixture components. In modal clustering, clusters are understood as regions of high d…

2016-09-15abs ↗pdf ↗

The CGMY model's ATM call-price asymptotics are derived using characteristic function.

problem Deriving short-time asymptotics for the CGMY model's ATM call prices.
method Using the characteristic function, derived short-time asymptotics for the CGMY model's ATM call prices. Extracted higher-order coefficients by dynamic cutoff partitioning.
result Higher-order coefficients are derived for the CGMY model's ATM call prices.

Framework improves agent's ability to learn from noisy images.

problem Agents tend to focus on distracting regions in unsupervised image-based goal exploration.
method Proposes a novel framework combining absolute Learning Progress with unsupervised image-based goal exploration.
result Agents successfully identify and ignore distracting regions, improving overall performance.

WSFN overcomes saddle points for non-convex functionals in Wasserstein space.

problem Minimizing non-convex functionals over the Wasserstein space with saddle point avoidance.
method WSFN is a second-order method that preconditions the Wasserstein gradient to avoid saddle points.
result WSFN escapes saddle regions and reaches a global minimizer in polynomial time.

A new model predicts spatio-temporal data using adaptive decision trees and point processes.

problem Predicting spatio-temporal data with real-life applications.
method Hawkes process, adaptive decision tree, joint optimization algorithm.
result Significant improvement in predictions compared to standard methods.

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.

New algorithms solve complex minimax problems efficiently.

problem Nonconvex-strongly concave minimax problems in machine learning.
method Gradient norm regularized trust-region (GRTR) and Levenberg-Marquardt (LMNegCur) algorithms.
result Proved iteration complexities matching best known results.

New algorithm improves convergence for non-convex problems with boundaries.

problem Optimizing non-convex problems with constraints.
method Reflected Gradient Langevin Dynamics with probabilistic representation.
result Promising convergence rates, faster than existing methods.