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

84168252336 · Jun 202019922001200920172026
48 results for global continuity

We show that the definition of global hyperbolicity in terms of the compactness of the causal diamonds and non-total imprisonment can be extended to spacetimes with continuous metrics, while retaining all of the equivalences to other notions of global hyperbolicity. In fact, global hyperbolicity is equivalent to the co…

2014-12-07abs ↗pdf ↗

Study on stability and continuity of solutions to complex Monge-Ampère equations on compact Hermitian manifolds.

problem Stability and continuity of solutions to degenerate complex Monge-Ampère equations.
method Analysis of Hölder continuity and global continuity of solutions.
result Established uniform diameter bound for the twisted Chern-Ricci flow.

Continuous-time distributed mirror descent with integral feedback converges to global optimum.

problem Distributed optimization of a global strongly convex function with local convex components.
method Continuous-time distributed mirror descent with integral feedback.
result Asymptotic convergence to global optimum with constant step-size.

Efficient algorithm for global optimization of multivariate Lipschitz functions.

problem Global optimization of multivariate Lipschitz continuous functions.
method Proposes an efficient minimax optimal algorithm using a predetermined query creation rule.
result Achieves an average regret bound of O(LnT1n)O(L\sqrt{n}T^{-\frac{1}{n}}), minimax optimal.

Proves Hölder continuity of complex Monge-Ampère solutions.

problem Global Hölder continuity of solutions to complex Monge-Ampère equation.
method Analyzes Dirichlet problem on strictly pseudoconvex domains or Hermitian manifolds.
result Proves global Hölder continuity of solutions under given conditions.

Paper solves DRO for continuous distributions with iterative algorithms.

problem Distributionally robust optimization with continuous worst-case distributions.
method Iterative algorithm for global convergence, leveraging Brenier's theorem and JKO scheme.
result Achieves global convergence under mild assumptions for minimax problems.

Foundation models fail to preserve continuous geometry, identified as the Geometric Alignment Tax.

problem Continuous geometry is lost in foundation models due to discrete categorical bottlenecks.
method Controlled ablations on synthetic systems and evaluation of 14 biological models using rate-distortion theory and MINE.
result Replacing cross-entropy with a continuous head reduces geometric distortion by up to 8.5x.

Efficient binary sampling method for global optimization of univariate functions with low regret.

problem Global optimization of univariate loss functions.
method Binary sampling approach to circumvent hard-to-determine query points in traditional methods.
result At most Llog(3T)L\log (3T) and 2.25H2.25H regret for LL-Lipschitz continuous and HH-Lipschitz smooth functions respectively.

ECP optimizes expensive functions without knowing Lipschitz constant.

problem Optimizing expensive, non-convex functions with unknown Lipschitz constants.
method ECP minimizes evaluations by focusing on potentially optimal regions, eliminating Lipschitz constant estimation.
result Guaranteed no-regret performance and minimax-optimal regret bounds.

CAM-GAN improves GANs for continual learning with efficient feature map transformations.

problem Efficient continual learning for GANs with reduced parameter growth.
method Designing and leveraging parameter-efficient feature map transformations, including global and task-specific parameters, residual bias, and Fisher information matrix.
result Significantly improved model performance and high-quality samples with fewer parameters.

We consider Aubry-Mather theory for a subclass of class A spacetimes, i.e. compact vicious spacetimes with globally hyperbolic Abelian cover. In this subclass, called class A_1, we obtain improved results on timelike maximizers and Lipschitz continuity of the time separation of the Abelian cover on the i.g. optimal sub…

2011-04-19abs ↗pdf ↗

We consider rough metrics on smooth manifolds and corresponding Laplacians induced by such metrics. We demonstrate that globally continuous heat kernels exist and are Hölder continuous locally in space and time. This is done via local parabolic Harnack estimates for weak solutions of operators in divergence form with b…

2017-12-26abs ↗pdf ↗

A new method for hierarchical clustering using continuous embeddings and optimization.

problem Hierarchical clustering with provable quality guarantees.
method Continuous relaxation of discrete optimization problem using hyperbolic embeddings and decoding.
result Continuous relaxation yields a discrete tree with (1 + epsilon)-factor approximation for optimal tree.

Example of spacetime with causal bubbling, splitting into timelike and spacelike parts.

problem Understanding causal bubbling in spacetimes.
method Example of a globally hyperbolic spacetime with a continuous metric, splitting orthogonally into timelike and spacelike parts.
result The synthetic timelike curvature-dimension (TCD) condition does not prevent causal bubbling.

Hybrid systems are characterized by having an interaction between continuous dynamics and discrete events. The contribution of this paper is to provide hybrid systems with a novel geometric formulation so that controls can be added. Using this framework we describe some new global controllability tests for hybrid contr…

2019-05-07abs ↗pdf ↗

New insights into continual learning for deep models, showing convergence issues but local linear solutions.

problem Challenges in continual learning for homogeneous deep models.
method Sequential projections onto task margin sets, leveraging nonconvex projection theory.
result Local linear convergence under certain conditions for homogeneous deep networks.

FS&P uses birth-death process to ensure global convergence of stochastic conic particle gradient descent.

problem Global optimization of non-convex objective functions over measure space.
method Introduces Fast Spawn\&Prune (FS\&P) combining CPGD with birth-death process.
result First theoretical guarantee of global convergence for discrete-time stochastic algorithms.

Paper proposes a new strategy to improve initial performance of federated models.

problem Weight divergence in Federated Averaging (FedAvg) leads to poor initial performance in federated models.
method Local continual training with importance weights evaluated on a proxy dataset.
result The method significantly improves the initial performance of federated models with minimal extra communication costs.

Proves existence of optimal shallow neural networks with ReLU activation.

problem Proving the existence of optimal shallow feedforward networks with ReLU activation.
method Proves existence of global minima in the loss landscape for continuous target functions using shallow feedforward neural networks with ReLU activation.
result Existence of global minima in the loss landscape for shallow feedforward networks with ReLU activation.

Proves convergence of mean curvature flow on cylinders with unique continuation.

problem Understanding the convergence and uniqueness of mean curvature flow on cylindrical surfaces.
method Proves convergence and provides unique continuation results for mean curvature flow on cylinders.
result Proves that rescaled mean curvature flow on cylinders converging super-exponentially must coincide with the cylinder itself.

For a bounded domain equipped with a piecewise Lipschitz continuous Riemannian metric g, we consider harmonic map from (Ω,g)(Ω, g) to a compact Riemannian manifold (N,h)Rk(N,h)\subset\mathbb R^k without boundary. We generalize the notion of stationary harmonic map and prove the partial regularity. We also discuss the global Li…

2011-08-22abs ↗pdf ↗

Lie groupoid equivariant neural networks are a new type of neural network.

problem Designing neural networks that respect the structure of Lie groupoids.
method Introducing Lie groupoid equivariant convolutions and layers, and showing their equivalence to Lie algebroid-equivariant networks.
result Lie groupoid equivariant neural networks are equivalent to certain Lie algebroid-equivariant networks.

Sufficient condition for log-continuity of complex Monge-Ampère solutions.

problem Ensuring log-continuity of solutions to complex Monge-Ampère equations.
method Analyzing compact Kähler manifolds and line bundles, providing sufficient conditions for log-continuity.
result Log-continuity of solutions to complex Monge-Ampère equations with LpL^p right-hand sides.

A federated model learns shared archetypes from heterogeneous clients in continual learning.

problem Federated learning struggles with client heterogeneity and streaming distribution shifts.
method Clients encode their data as low-rank Hebbian operators, which are sent to a central server for aggregation and factorization into global archetypes.
result Improved global archetype reconstruction and associative retrieval in heterogeneous clients, drift, and novelty settings.

The chapter explores globally hyperbolic spacetimes using topology and functional analysis.

problem Understanding global hyperbolicity in spacetimes.
method Foundational tools from order theory and topology, geometric analysis, and connections to physics.
result A connection between global hyperbolicity and geodesic completeness of space-like surfaces.

Continuing our previous work (arXiv:1509.07981v1), we derive another global gradient estimate for positive functions, particularly for positive solutions to the heat equation on finite or locally finite graphs. In general, the gradient estimate in the present paper is independent of our previous one. As applications, i…

2015-10-24abs ↗pdf ↗

The paper analyzes the current state of the world economy and offers a short-term forecast of its development. Our analysis of log-periodic oscillations in the DJIA dynamics suggests that in the second half of 2017 the United States and other more developed countries could experience a new recession, due to the third p…

2016-12-29abs ↗pdf ↗

SGD converges globally to logistic loss minima for two-layer nets.

problem Global convergence of SGD for logistic loss on two-layer neural nets.
method Demonstrates existence of Frobenius norm regularized logistic loss functions as Villani functions, proving convergence and exponential rate.
result SGD converges globally to the global minima of appropriately regularized logistic empirical risk of depth 2 nets.