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

162324486648 · Jun 202019922001200920172026
48 results for Sierpiński function

The paper examines properties of self-affine Sierpiński sponges using metric invariants.

problem Investigating properties of self-affine Sierpiński sponges using metric invariants.
method Examined through maximal power law property and perfectly disconnectedness.
result Characterized self-affine Sierpiński sponges by their metric properties.

It is shown that if MM is a strongly causal free of naked singularities space-time, then its causal structure is completely characterized by a partial order in the space of skies defined by means of a class non-negative Legendrian isotopies. It is also proved that such partial order is determined by the class of futur…

2014-11-06abs ↗pdf ↗

This paper analyzes error in SKI for Gaussian Processes, providing conditions for linear time inference.

problem Lack of rigorous theoretical error analysis for SKI.
method Proved error bounds for SKI Gram matrix, examined error effects, provided practical guidelines.
result Identified two dimensionality regimes for SKI's scalability-accuracy trade-offs.

Efficiently maps indoor magnetic fields with SKI and D-SKI.

problem Computing large-scale magnetic field maps in indoor environments.
method Structured kernel interpolation (SKI) with derivatives (D-SKI) for Gaussian process regression.
result Achieves better accuracy and faster computation than state-of-the-art methods.

SoftKI combines SKI and variational methods for scalable GP regression.

problem Scalable Gaussian Process regression on high-dimensional datasets.
method SoftKI approximates kernel via softmax interpolation from a smaller number of learned points.
result SoftKI is competitive with other approximated GP methods for modest data dimensions.

Recent work shows that inference for Gaussian processes can be performed efficiently using iterative methods that rely only on matrix-vector multiplications (MVMs). Structured Kernel Interpolation (SKI) exploits these techniques by deriving approximate kernels with very fast MVMs. Unfortunately, such strategies suffer …

2018-02-24abs ↗pdf ↗

The paper proposes calibration to improve algorithm performance using machine learning predictions.

problem Improving real-world performance of online algorithms with machine learning predictions.
method Calibration as a tool to bridge the gap between prediction uncertainty and algorithm design.
result Calibrated advice leads to more effective guidance in high-variance settings and significant performance improvements in real-world data.

SKI speeds up Toeplitz Neural Networks by avoiding explicit decay bias and using frequency response.

problem Efficiently compute and update Toeplitz matrices in neural networks.
method Sparse plus low-rank decomposition, asymmetric SKI, frequency response modeling.
result Achieved significant speedup with minimal performance loss.

Kernel-based machine learning approaches are gaining increasing interest for exploring and modeling large dataset in recent years. Gaussian process (GP) is one example of such kernel-based approaches, which can provide very good performance for nonlinear modeling problems. In this work, we first propose a grey-box mode…

2019-07-05abs ↗pdf ↗

The set N of all null geodesics of a globally hyperbolic (d+1)-dimensional spacetime (M,g) is naturally a smooth (2d-1)-dimensional contact manifold. The sky of an event is the subset of N defined by all null geodesics through that event, and is an embedded Legendrian submanifold of N diffeomorphic to a (d-1)-dimension…

2002-10-11abs ↗pdf ↗

Let SS be a compact, orientable surface of hyperbolic type. Let (k+,k)(k_+,k_-) be a pair of negative numbers and let (g+,g)(g_+, g_-) be a pair of marked metrics over SS of constant curvature equal to k+k_+ and kk_- respectively. Using a functional introduced by Bonsante, Mondello \& Schlenker, we show that there exists a …

2018-08-15abs ↗pdf ↗

We define a conformal reference frame, i.e., a special projection of the six-dimensional sky bundle of a Lorentzian manifold (or the five-dimensional twistor space) to a three-dimensional manifold. We construct an example, a conformal compactification, for Minkowski space. Based on the complex structure on the skies, w…

2016-05-23abs ↗pdf ↗

We show that every inner metric space X is the metric quotient of a complete R-tree via a free isometric action, which we call the covering R-tree of X. The quotient mapping is a weak submetry (hence, open) and light. In the case of compact 1-dimensional geodesic space X, the free isometric action is via a subgroup of …

2007-07-24abs ↗pdf ↗

Researchers compute contact structures for null geodesics on specific spacetimes.

problem Understanding the canonical contact structure of null geodesics in spacetimes.
method Explicit calculations for specific spacetimes, including lens spaces and three-dimensional spacetimes.
result Contact structures on null geodesics are derived from the Lorentz prolongation of spacetimes.

The linking number lklk is defined if link components are zero homologous. Our affine linking invariant alkalk generalizes lklk to the case of linked submanifolds with arbitrary homology classes. We apply alkalk to the study of causality in Lorentz manifolds. Let MmM^m be a spacelike Cauchy surface in a globally hyperbol…

2006-11-05abs ↗pdf ↗

Develops methods for selecting and estimating smooth functional coefficients in high-dimensional multivariate functional data.

problem Functional predictor selection and estimation of smooth functional coefficients in high-dimensional multivariate functional data.
method Functional group-sparse regression methods in a generic Hilbert space of infinite dimension.
result Consistency of estimation and selection (oracle property) under infinite-dimensional Hilbert spaces.

FFBO optimizes functions as inputs and outputs, improving on existing BO methods.

problem Optimizing functions as both inputs and outputs in complex systems.
method Function-on-function Gaussian process (FFGP) model with a separable operator-valued kernel, scalar upper confidence bound (UCB) acquisition function, and scalable functional gradient ascent algorithm (FGA).
result FFBO outperforms existing methods in synthetic and real-world data.

Chirped sinosoids and interferometric phase plots are functions that are not periodic, but are the composition of a smooth function and a periodic function. These functions functions factor into a pair of maps: from their domain to a circle, and from a circle to their codomain. One can easily imagine replacing the circ…

2015-01-25abs ↗pdf ↗

The Fridman function is bounded by the injectivity radius for certain hyperbolic manifolds.

problem Bounding the Fridman function for hyperbolic manifolds.
method Analyzing the relationship between the Fridman function and the injectivity radius function.
result The Fridman function is bounded above by the injectivity radius function for certain hyperbolic manifolds.

The paper proves isoparametric functions on Finsler space forms under specific conditions.

problem Understanding isoparametric functions in Finsler space forms.
method Proving transnormal functions as isoparametric functions and constructing global and local isoparametric functions using the distance function.
result Generalization of Theorem B to Finsler space forms.

Paper introduces a nonparametric functional graphical model for random functions.

problem Estimating probabilistic conditional independence in functional graphical models.
method Functional sufficient dimension reduction to relax Gaussian or copula Gaussian assumptions.
result Enhances estimation accuracy and retains probabilistic conditional independence.

Robustifies elicitable functionals to handle small distribution misspecifications.

problem Determining uniquely optimal forecasts under distributional misspecification.
method Integrates statistical robustness into elicitable functionals using Kullback-Leibler divergence.
result Robust elicitable functionals admit unique solutions at the boundary of uncertainty regions.

The paper characterizes strong Hamel functions using symmetries and proves their preservation properties.

problem Characterizing strong Hamel functions and their symmetries in Finsler spaces.
method Analyzing geodesic spray, strong dual symmetries, and strong dynamical symmetries.
result Strong Hamel functions can be characterized in terms of strong dual symmetries and strong dynamical symmetries.

Two new methods improve forecasting of functional time series data.

problem Forecasting of functional time-dependent data.
method Functional Singular Spectrum Analysis (FSFA) based forecasting methods.
result Our methods outperform existing algorithms for periodic stochastic processes.

Study stabilizers of smooth functions on surfaces, focusing on Morse-Bott functions.

problem Understanding the homotopy type of stabilizers of smooth functions on surfaces.
method Analyzing the homotopy properties of stabilizers for a specific class of smooth functions.
result The homotopy type of the connected component of the identity map of the stabilizer is completely described for Morse-Bott functions.

The paper connects convex functions to p-subharmonic functions and proves their equivalence.

problem Understanding the relationship between convex functions and p-subharmonic functions.
method Average principle, variational methods, and PDE techniques.
result Convex functions on R^n are p-subharmonic for every p > 1.

A new deep neural network tackles nonlinear functional regression with improved dimensionality reduction.

problem Nonlinear functional regression in infinite-dimensional functional data analysis.
method Functional deep neural network with adaptive kernel embedding and projection steps.
result Explicit rates of approximating nonlinear smooth functionals are derived, and the network is shown to be effective in both simulated and real datasets.

New model for network analysis using functional data.

problem Existing network models treat nodes as functions, but this paper introduces functional edges.
method Transform adjacency matrix into functional adjacency tensor, apply Tucker decomposition, regularize basis matrices, and solve tensor completion problem.
result The model effectively captures community structure and handles irregular functional edge data.

The study finds a special type of smooth function on connected sums of manifolds.

problem Finding smooth functions that are Morse on preimages of non-extrema values.
method Investigates internally Morse (I-Morse) and neat with respect to Reeb graph (N-Reeb) functions.
result Constructs an IN-Morse-Reeb function on a connected sum of given manifolds.