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

3517021,0521,403 · Jun 202019922001200920172026
48 results for telescoping model

Study on homeomorphism groups of telescoping 2-manifolds showing strong distortion.

problem Characterizing the homeomorphism group of telescoping 2-manifolds.
method Introduced telescoping 2-manifolds, studied homeomorphism groups, and used commutator subgroup properties.
result Homeomorphism group of telescoping 2-manifolds is strongly distorted.

A group action H on X is called "telescopic" if for any finitely presented group G, there exists a subgroup H' in H such that G is isomorphic to the fundamental group of X/H'. We construct examples of telescopic actions on some CAT[-1] spaces, in particular on 3 and 4-dimensional hyperbolic spaces. As applications we g…

2011-04-25abs ↗pdf ↗

We study topology of configuration spaces of planar linkages having one leg of variable length. Such telescopic legs are common in modern robotics where they are used for shock absorbtion and serve a variety of other purposes. Using a Morse theoretic technique, we compute explicitly, in terms of the metric data, the Be…

2009-09-16abs ↗pdf ↗

A simple model explains deep learning phenomena like grokking and gradient boosting.

problem Understanding the unexpected behaviors of deep learning models.
method A telescoping sequence of first-order approximations to explain neural network performance.
result Empirical insights into neural network performance and training process.

Algorithm finds Liouvillian solutions for planar rational vector fields.

problem Finding Liouvillian solutions for planar rational vector fields.
method Algorithm to compute telescoper for specific foliations and rational vector fields.
result Algorithm finds Liouvillian solutions for planar rational vector fields, given a large enough complexity bound.

New methods model gamma-ray data to better understand Galactic emissions.

problem Uncertain diffuse Galactic gamma-ray emissions bias data interpretation.
method Gaussian processes and variational inference for flexible modeling.
result More robust interpretation of gamma-ray sky, especially dark matter signals.

The purpose of the paper is two-fold: to introduce a multivariable creative telescoping method, and to apply it in a problem of Quantum Topology: namely the computation of the non-commutative AA-polynomial of twist knots. Our multivariable creative telescoping method allows us to compute linear recursions for sums of …

2008-02-27abs ↗pdf ↗

Given a pair of integers m and n such that 1 < m < n, we show that every n-dimensional manifold admits metrics of arbitrarily small total volume, and possessing the following property: every m-dimensional submanifold of less than unit m-volume is necessarily torsion in homology. This result is different from the case o…

2001-06-19abs ↗pdf ↗

SPT predicts age and mass of red giants from spectra.

problem Challenges in age and mass estimation of red giants using traditional methods.
method SPT framework with Multi-head Hadamard Self-Attention and Mahalanobis distance-based loss function.
result Remarkable age and mass estimations with low errors and uncertainties.

A new SBI framework for trawl processes efficiently estimates parameters from large datasets.

problem Challenges in estimating parameters of complex stochastic processes.
method Telescoping ratio estimation, Chebyshev polynomial approximations, amortized posterior inference.
result Accurate and efficient inference for intractable stochastic processes, even with limited data.

Blind source separation (BSS) aims at recovering signals from mixtures. This problem has been extensively studied in cases where the mixtures are contaminated with additive Gaussian noise. However, it is not well suited to describe data that are corrupted with Poisson measurements such as in low photon count optics or …

2018-12-11abs ↗pdf ↗

Polarization measurements done using Imaging Polarimeters such as the Robotic Polarimeter are very sensitive to the presence of artefacts in images. Artefacts can range from internal reflections in a telescope to satellite trails that could contaminate an area of interest in the image. With the advent of wide-field pol…

2019-11-19abs ↗pdf ↗

Signed compression progress on a sealed audit is goodhart-resistant.

problem Intrinsic motivation for agents to improve their world models by compressing experience.
method Rewarding agents for the signed decrease of a fixed sealed-audit loss.
result Cumulative reward telescopes exactly to endpoint audit improvement, preventing infinite reward push while true audit performance stagnates.

The Large Synoptic Survey Telescope will complete its survey in 2022 and produce terabytes of imaging data each night. To work with this massive onset of data, automated algorithms to classify astronomical light curves are crucial. Here, we present a method for automated classification of photometric light curves for a…

2019-09-10abs ↗pdf ↗

We define inductively isometric embeddings of $\mb{P}^n(\mb{R})$ and $\mb{P}^n(\mb{C})$ (with their canonical metrics conveniently scaled) into the standard unit sphere, which present the former as the restriction of the latter to the set of real points. Our argument parallels the telescopic construction of $\mb{P}^\in…

2018-12-25abs ↗pdf ↗

This paper quantifies and mitigates a bias in the Hayashi-Yoshida estimator causing data loss.

problem Formulaic bias in the Hayashi-Yoshida estimator leading to data loss.
method Formalizes and quantifies the data loss, introduces (a,b)-asynchronous adversary, and provides algorithms.
result Proves that for equal rates, the minimal average cumulative data loss is 25%.

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This enhances the already known results by Frucht, Cori -- Machì, Širáň -- Škoviera, and …

2019-01-17abs ↗pdf ↗

Muon optimizes training efficiency by improving data retention at large batch sizes.

problem Improving training efficiency and data retention at large batch sizes.
method Introducing Muon, a second-order optimizer, and combining it with muP for efficient hyperparameter transfer.
result Muon outperforms AdamW in retaining data efficiency at large batch sizes, enabling more economical training.

We propose a method for maximizing a partial area under a receiver operating characteristic (ROC) curve (pAUC) for binary classification tasks. In binary classification tasks, accuracy is the most commonly used as a measure of classifier performance. In some applications such as anomaly detection and diagnostic testing…

2018-06-13abs ↗pdf ↗

ScoreMatchingRiesz improves debiased machine learning and policy effects estimation.

problem Improving debiased machine learning and policy effects estimation.
method Score matching and Riesz representer estimation.
result Estimates policy path for continuous treatments, improving interpretability.

Coarse homotopy theory connects Euclidean cones to shape theory of compact spaces.

problem Establishing connections between coarse homotopy theory and shape theory.
method Using pointed shape invariants and inverse mapping telescopes.
result Proving two compact spaces are strong shape equivalent if their Euclidean cones are coarsely homotopy equivalent.

Develops a multilevel Monte Carlo framework with dropout for efficient uncertainty quantification.

problem Efficiently quantify uncertainty in complex models using dropout.
method Integrates multilevel Monte Carlo with Monte Carlo dropout, creating coupled estimators to reduce variance.
result Demonstrates significant variance reduction and efficiency gains over single-level Monte Carlo dropout.

We compute the Khovanov lasagna module of S²×S², confirming a conjecture.

problem Computing the Khovanov lasagna module of S²×S².
method Interpreting Manolescu-Neithalath's formula as a homotopy colimit, using categorified projectors.
result The Khovanov lasagna module of S²×S² is trivial.