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

Trend · papers per month

58115173230 · Jun 202019922001200920172026
48 results for positive speed

Classifies self-similar solutions for heat equations with positive speed.

problem Classifying self-similar solutions for semilinear heat equations.
method Analyzes the semilinear heat equation ut=Δu+up1uu_t=Δu+|u|^{p-1}u for p>1p>1.
result Finite time blowing up solutions converge to a positive constant after rescaling.

We consider embedded hypersurfaces evolving by fully nonlinear flows in which the normal speed of motion is a homogeneous degree one, concave or convex function of the principal curvatures, and prove a non-collapsing estimate: Precisely, the function which gives the curvature of the largest interior sphere touching the…

2011-09-10abs ↗pdf ↗

Homeomorphisms of hyperbolic 3-manifolds have invariant sets under certain conditions.

problem Understanding invariant sets for homeomorphisms on hyperbolic 3-manifolds.
method Shadowing techniques and analysis of invariant sets under positive speed with respect to a uniform foliation.
result Homeomorphisms of hyperbolic 3-manifolds are forced to have invariant sets, preventing them from being minimal.

Symbolic dynamics for flows in high dimensions, extending previous work.

problem Coding flows with positive speed in high dimensions.
method Construct symbolic dynamics for flows with positive speed in any dimension.
result Extended symbolic dynamics to flows in high dimensions, including homoclinic classes.

A Riemannian symmetric space is a Riemannian manifold in which it is possible to reflect all geodesics through a point by an isometry of the space. On such spaces, we introduce the notion of a distributional lattice, generalizing the notion of lattice. Distributional lattices exist in any Riemannian symmetric space: th…

2017-07-02abs ↗pdf ↗

Curvature flows in hyperbolic space preserve positive sectional curvature and contract to a point.

problem Preserving positive sectional curvature in contracting curvature flows in hyperbolic space.
method Homogeneous speed flow with positive sectional curvature, including kkth mean curvature flow.
result Positive sectional curvature is preserved and the hypersurface contracts to a round point in finite time.

Quantum algorithms for multi-armed bandits are explored with limited reward access.

problem Exploring quantum speed-ups in multi-armed bandit problems with limited reward information.
method Introduced new bandit models and showed query complexity equivalence with classical algorithms.
result No quadratic speed-up is possible for multi-armed bandits with limited reward access.

The paper studies how convex hypersurfaces in hyperbolic space evolve under a specific curvature flow.

problem Volume preserving Gauss curvature flow in hyperbolic space.
method Analyzes a flow of smooth, closed, and convex hypersurfaces in hyperbolic space with a nonhomogeneous speed function.
result The flow remains convex, exists for all time, and converges to a geodesic sphere exponentially.

We study flows of hypersurfaces in Riemannian manifolds with specific curvature speeds.

problem Understanding the evolution of hypersurfaces in Riemannian manifolds under Weingarten conditions.
method Investigating Weingarten flows with a Weingarten function that is homogeneous, monotonic, and positive.
result Existence and embedding preserving properties of Weingarten flows with isoparametric initial data.

Distributed securities exchanges may become de facto fragmented if they span geographical regions with asymmetric computer infrastructure. First, we build an economic model of a decentralized exchange with two miner clusters, standing in for compact areas of economic activity (e.g., cities). "Local" miners in the area …

2019-10-24abs ↗pdf ↗

Research shows that information asymmetry affects how quickly companies adjust their capital structure and expected returns.

problem The relationship between capital structure adjustment speed and expected returns is influenced by information asymmetry.
method A hybrid data regression model was used to test the hypotheses based on data from 120 companies in the Tehran Stock Exchange.
result Information asymmetry positively affects the relationship between capital structure adjustment speed and expected returns.

We consider the quermassintegral preserving flow of closed \emph{h-convex} hypersurfaces in hyperbolic space with the speed given by any positive power of a smooth symmetric, strictly increasing, and homogeneous of degree one function ff of the principal curvatures which is inverse concave and has dual ff_* approachi…

2017-08-31abs ↗pdf ↗

Unified flow solves LpL^p Christoffel-Minkowski problem for p>1p>1.

problem Solving the LpL^p Christoffel-Minkowski problem for p>1p>1.
method Anisotropic expanding flow of smooth hypersurfaces with speed ψσk(λ)αψσ_k(λ)^α.
result The flow converges to a solution of the LpL^p Christoffel-Minkowski problem.

The study proves uniqueness and symmetry of self-similar solutions in warped product spaces.

problem Uniqueness and symmetry of self-similar solutions in warped product spaces.
method Analysis of curvature flows with homogeneous speed functions in warped product spaces.
result Compact star-shaped self-similar solutions in warped product spaces are slices.

A novel GNN architecture improves link prediction by combining positive and negative samples.

problem Link prediction accuracy limited by node-wise methods and increased model complexity of edge-wise methods.
method Proposes a novel GNN architecture that uses both positive and negative samples to inform node embeddings.
result The method retains the inference speed of node-wise models while achieving competitive accuracy with edge-wise alternatives.

Kriformer uses graph transformers to estimate data in sparse sensor areas.

problem Sparse sensor deployment and unreliable data in spatiotemporal kriging tasks.
method Graph transformer model with positional encoding and attention mechanisms.
result Kriformer excels in representing unobserved locations in spatiotemporal kriging tasks.

We present a noise-injected version of the Expectation-Maximization (EM) algorithm: the Noisy Expectation Maximization (NEM) algorithm. The NEM algorithm uses noise to speed up the convergence of the EM algorithm. The NEM theorem shows that injected noise speeds up the average convergence of the EM algorithm to a local…

2018-01-12abs ↗pdf ↗

We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This solution possesses several very attractive properties: (i) an innate geometric app…

2016-07-18abs ↗pdf ↗

Physics-informed neural network identifies and characterizes surface cracks in metals.

problem Identifying and characterizing surface-breaking cracks in metals using ultrasound.
method Physics-informed neural network (PINN) trained with ultrasonic surface wave data and adaptive activation functions.
result PINN accurately estimates the speed of sound and identifies crack locations in metals.

We study the motion of an nn-dimensional closed spacelike hypersurface in a Lorentzian manifold in the direction of its past directed normal vector, where the speed equals a positive power pp of the mean curvature. We prove that for any p(0,1]p\in (0,1], the flow exists for all time when the Ricci tensor of the ambient s…

2006-02-13abs ↗pdf ↗

Efficiently visualizes uncertainty in local divergence of 2D vector fields.

problem Uncertainty in vector field data leads to inaccurate divergence computations.
method Closed-form approach for highly efficient and accurate uncertainty visualization of local divergence, assuming independently Gaussian-distributed vector uncertainties.
result Significantly enhanced efficiency and accuracy of our algorithms over classical MC approach.

Evolving smooth, compact hypersurfaces in R^{n+1} with normal speed equal to a positive power k of the mean curvature improves a certain 'isoperimetric difference' for k >= n-1. As singularities may develop before the volume goes to zero, we develop a weak level-set formulation for such flows and show that the above mo…

2006-06-27abs ↗pdf ↗

Paper refutes EM convergence theory and introduces a new EM algorithm.

problem The convergence theory of the EM algorithm is incorrect and affects its performance.
method Proposes a new EM algorithm called the Channel Matching (CM) EM algorithm and provides an initialization map.
result The locally maximal Q can affect the convergent speed but not the global convergence.

Consider a broken geodesics α([0,l])α([0,l]) on a compact Riemannian manifold (M,g)(M,g) with boundary of dimension n3n\geq 3. The broken geodesics are unions of two geodesics with the property that they have a common end point. Assume that for every broken geodesic α([0,l])α([0,l]) starting at and ending to the boundary M\partial M

2007-03-17abs ↗pdf ↗

Quantifying the importance and power of individual nodes depending on their position in socio-economic networks constitutes a problem across a variety of applications. Examples include the reach of individuals in (online) social networks, the importance of individual banks or loans in financial networks, the relevance …

2019-06-14abs ↗pdf ↗

Exchanges acquire excess processing capacity to accommodate trading activity surges associated with zero-sum high-frequency trader (HFT) "duels." The idle capacity's opportunity cost is an externality of low-latency trading. We build a model of decentralized exchanges (DEX) with flexible capacity. On DEX, HFTs acquire …

2019-07-24abs ↗pdf ↗

Scarce data is a major challenge to scaling robot learning to truly complex tasks, as we need to generalize locally learned policies over different "contexts". Bayesian optimization approaches to contextual policy search (CPS) offer data-efficient policy learning that generalize over a context space. We propose to impr…

2016-12-06abs ↗pdf ↗

This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently computable. We propose a variant to the original speed prior (Schmidhuber, 2002),…

2016-04-12abs ↗pdf ↗

Best performing nuclear segmentation methods are based on deep learning algorithms that require a large amount of annotated data. However, collecting annotations for nuclear segmentation is a very labor-intensive and time-consuming task. Thereby, providing a tool that can facilitate and speed up this procedure is very …

2019-09-07abs ↗pdf ↗

Denise learns a function to quickly decompose covariance matrices robustly.

problem Robustly decomposing covariance matrices for feature extraction.
method Deep learning for symmetric positive semidefinite matrices.
result Denise achieves state-of-the-art performance in decomposition quality and speed.

Paper analyzes factors affecting COVID-19 risk in US counties.

problem Identifying factors influencing COVID-19 risk in US counties.
method Combines unsupervised (K-means clustering) and supervised learning models.
result Mean temperature, poverty, obesity, and other factors are most significant.