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

6121723 · Oct 202519922001200920172026
48 results for non-smooth spacetimes

Timelike curvature and Brunn-Minkowski inequality linked in non-smooth spacetimes.

problem Equivalence between timelike Ricci curvature and Brunn-Minkowski inequality in synthetic Lorentzian spaces.
method Introducing strong qq-timelike Brunn-Minkowski condition and proving equivalence to curvature conditions.
result Timelike curvature dimension condition equivalent to timelike Brunn-Minkowski inequality in specific settings.

Synthetic framework for null hypersurfaces in non-smooth spacetimes.

problem Analyzing null hypersurfaces in non-smooth spacetimes.
method Develops synthetic null hypersurfaces using optimal transport and Lorentzian geometry.
result Synthetic null energy condition stabilizes under convergence and applies to low-regularity spacetimes.

New approach confirms Kruskal-Szekeres extension for Schwarzschild spacetime.

problem Confirming the Kruskal-Szekeres extension for Schwarzschild spacetime.
method Reformulating the problem as an ODE and showing the ODE admits a solution if and only if the horizon is non-degenerate.
result Photon surfaces approaching the Killing horizon must necessarily cross it.

The paper studies convergence of cosmological spacetimes using null distance.

problem Convergence of cosmological spacetimes with compact slices.
method Using null distance and Gromov-Hausdorff convergence, the paper establishes convergence results for spacetimes with mild extension properties.
result Uniform convergence of null distances and Gromov-Hausdorff convergence for monotone sequences of spacetimes.

The question whether a Riemannian manifold is geodesically connected can be studied from geometrical as well as variational methods, and accurate results can be obtained by using the associated distance and related properties of the positive-definiteness. It is natural to state this problem in manifolds with (possibly …

2000-05-04abs ↗pdf ↗

MARINA-P improves non-smooth federated optimization with adaptive stepsizes.

problem Non-smooth federated optimization in machine learning applications.
method Extends EF21-P and MARINA-P to non-smooth convex setting, proving optimal convergence rate and communication complexity bounds.
result MARINA-P achieves O(1/T)O(1/\sqrt{T}) convergence rate and communication complexity matching classical subgradient methods.

We introduce non-smooth symplectic forms on manifolds and describe corresponding Poisson structures on the algebra of Colombeau generalized functions. This is achieved by establishing an extension of the classical map of smooth functions to Hamiltonian vector fields to the setting of non-smooth geometry. For mildly sin…

2014-03-02abs ↗pdf ↗

The paper challenges the smooth null infinity model by constructing counter-examples and showing non-smoothness of null infinity.

problem The structure of gravitational radiation near infinity, particularly at smooth null infinity.
method Constructing solutions to the spherically symmetric Einstein-Scalar field equations and analyzing asymptotic behavior.
result The asymptotic expansion of the derivative of the scalar field near null infinity contains logarithmic terms, indicating non-smoothness.

The paper explores various stationarity concepts in non-smooth optimization.

problem Understanding stationarity in non-smooth optimization problems.
method Introduction and discussion of different stationarity concepts for non-convex non-smooth functions.
result Clarification of the relationship among different stationarity concepts and their relevance in iterative methods.

New bounds explain deterministic non-smooth deep nets without large Lipschitz constants.

problem Challenges in explaining generalization of deterministic non-smooth deep nets.
method De-randomized PAC-Bayes margin bounds for deterministic non-convex and non-smooth predictors.
result New bounds avoid large Lipschitz constants, providing generalization guarantees.

Smoothness analysis of adversarial training reveals LL_\infty constraints cause more non-smoothness.

problem Non-smoothness of adversarial training loss function.
method Analyzed the smoothness of adversarial training loss function using optimal attacks for model parameters.
result The LL_\infty constraint causes more non-smoothness than L2L_2 constraint.

In the framework of Lorentzian warped products, we study the Friedmann-Robertson-Walker cosmological model to investigate non-smooth curvatures associated with multiple discontinuities involved in the evolution of the universe. In particular we analyze non-smooth features of the spatially flat Friedmann-Robertson-Walke…

2003-08-16abs ↗pdf ↗

This work speeds up hyperparameter selection for non-smooth convex models using implicit differentiation.

problem Optimizing hyperparameters of non-smooth convex models.
method Implicit differentiation of proximal gradient and coordinate descent methods.
result Implicit differentiation can speed up hyperparameter optimization, especially for non-smooth problems.

Positive mass theorem for non-smooth metrics on flat manifolds with corners.

problem Proving a positive mass theorem for non-smooth metrics on asymptotically flat manifolds with non-compact boundary.
method Proves a positive mass theorem for metrics that are only continuous across a compact hypersurface.
result Obtains a positive mass theorem on manifolds with non-compact corners.

Advances smooth over-parameterization for solving non-smooth optimization problems.

problem Non-smooth optimization with structural constraints in imaging and machine learning.
method Smooth over-parameterization of non-smooth problems, using gradient descent and mirror descent.
result Gradient descent on the reformulated smooth problem converges efficiently without parameter tuning.

New methods improve convergence in non-convex non-smooth learning problems.

problem Sparse learning from high-dimensional data with non-convex, non-smooth regularizers.
method Stochastic proximal gradient methods with arbitrary sampling.
result Independent sampling improves performance over uniform sampling.

The paper finds conditions for pseudosymmetric spacetimes to be perfect fluids.

problem Characterizing pseudosymmetric spacetimes as perfect fluids.
method Analyzes generalized Robertson-Walker spacetimes, conformally flat spacetimes, and dust fluids.
result Conditions for pseudosymmetric spacetimes to be perfect fluids are established.

We consider (flat) Cauchy-complete GH spacetimes, i.e., globally hyperbolic flat lorentzian manifolds admitting some Cauchy hypersurface on which the ambient lorentzian metric restricts as a complete riemannian metric. We define a family of such spacetimes - model spacetimes - including four subfamilies: translation sp…

2004-02-16abs ↗pdf ↗

New SPS variant improves non-smooth optimization without small gradients.

problem Improving non-smooth optimization without small gradients.
method Safeguarded Stochastic Polyak Step Size (SPSsafe_{safe}) for non-smooth optimization.
result Rigorous convergence guarantees for non-smooth convex optimization without strong assumptions.

The paper introduces and analyzes pseudo generalized Ricci-recurrent spacetimes in modified gravity.

problem Characterizing and analyzing pseudo generalized Ricci-recurrent spacetimes in modified gravity.
method Introducing and characterizing pseudo generalized Ricci-recurrent spacetimes, proving their properties, and studying their impact under modified gravity scenarios.
result Pseudo generalized Ricci-recurrent spacetimes represent specific spacetime types under modified gravity scenarios.

The study characterizes spacetimes with quasi-constant sectional curvature and explores their properties in F(R)\mathcal{F}(\mathcal{R})-gravity.

problem Characterizing spacetimes with quasi-constant sectional curvature.
method Investigation through examples, proofs, and analysis of energy conditions.
result A spacetime of quasi-constant sectional curvature can represent a Robertson Walker spacetime or a static spacetime.

The article introduces pseudo generalized Ricci-recurrent spacetimes and their applications in modified gravity.

problem Characterizing and understanding pseudo generalized Ricci-recurrent spacetimes.
method Introduced and characterized pseudo generalized Ricci-recurrent spacetimes, provided examples, and studied their implications in modified gravity.
result Pseudo generalized Ricci-recurrent spacetimes represent perfect fluid spacetimes and can model dark energy epochs or static spacetimes.

The paper studies the past inextendibility of FLRW spacetimes using the VDR asymptote.

problem Investigating the past inextendibility of FLRW spacetimes.
method Using the volume-distance-ratio (VDR) asymptote to assess spacetime inextendibility criteria.
result Conditions for past inextendibility of FLRW spacetimes are identified.

Study explores geometric properties of Vaidya-Bonner-de Sitter spacetime.

problem Exploring geometric properties of Vaidya-Bonner-de Sitter spacetime.
method Analyzing conformal curvature, conharmonic curvature, and other curvatures.
result VBdS spacetime exhibits various pseudosymmetric structures and geometric features.

The study characterizes GRW spacetimes with gradient solitons and phantom era.

problem Characterizing generalized Robertson-Walker spacetimes with gradient solitons.
method Examined gradient type Ricci solitons and (m,τ)(m,τ)-quasi Einstein solitons in GRW spacetimes.
result Demonstrated that GRW spacetimes can be Robertson-Walker or phantom era spacetimes under certain conditions.

Characterizes Lorentzian manifolds embeddable in Minkowski spacetime.

problem Identifying Lorentzian manifolds embeddable in Minkowski spacetime.
method Characterization and proof of embeddability conditions.
result Lorentzian manifolds embeddable in Minkowski spacetime coincide with globally hyperbolic spacetimes.

Stochastic approximation proves asymptotic normality for non-smooth problems.

problem Solving non-smooth stochastic approximation problems.
method Stochastic approximation algorithms for solving smooth equations, extended to non-smooth problems.
result Asymptotic normality and optimality in non-smooth stochastic approximation is proven.

New proof shows FLRW spacetimes can't be extended smoothly in certain axisymmetric cases.

problem Proving smooth extension of FLRW spacetimes in specific spacetime classes.
method Extending previous work on spherically symmetric spacetimes to axisymmetric spacetimes.
result Demonstrates C0C^0-inextendibility for FLRW spacetimes in a subclass of axisymmetric spacetimes.

We provide improved convergence rates for various \emph{non-smooth} optimization problems via higher-order accelerated methods. In the case of \ell_\infty regression, we achieves an O(ε4/5)O(ε^{-4/5}) iteration complexity, breaking the O(ε1)O(ε^{-1}) barrier so far present for previous methods. We arrive at a similar rate fo…

2019-06-04abs ↗pdf ↗

Characterizes pseudo B-symmetric spacetimes and their implications in f(R) gravity.

problem Characterizing pseudo B-symmetric spacetimes and their properties.
method Analyzes Codazzi type of B-tensor and applies f(R) gravity model.
result Pseudo B-symmetric spacetimes with Codazzi type B-tensor are conformally flat and Robertson-Walker spacetimes.

Study maximal hypersurfaces in open spacetimes using a maximum principle.

problem Characterize maximal hypersurfaces in open spacetimes.
method Use a generalized maximum principle to analyze hypersurfaces in spatially open Generalized Robertson-Walker spacetimes.
result Provide new uniqueness and non-existence results for complete maximal hypersurfaces in open Robertson-Walker spacetimes.