We overview few results which use the construction described in our paper "Telescopic actions".
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “telescopic construction”
We embed projective spaces into spheres using telescopic constructions.
problem Embedding projective spaces into spheres isometrically.
method Inductive telescopic construction extending previous embeddings.
result Isometric embeddings defined for projective real and complex spaces.
Telescopic actionsmath.GR
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…
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.
Particle identification in ground-based gamma-ray astronomy using convolutional neural networksastro-ph.IM
CNNs improve particle identification in ground-based gamma-ray astronomy.
problem Identifying particles in gamma-ray astronomy images.
method Used convolutional neural networks (CNNs) with PyTorch and TensorFlow.
result Improved accuracy in identifying gamma-rays and background particles.
Telescope detects LLM generated text by measuring token repetition probability.
problem Distinguishing LLM generated text from human writing.
method Telescope Perplexity, evaluating token repetition probability.
result Telescope Perplexity enables effective zero-shot LLM detection.
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.
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…
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.
RT estimators provide unbiased gradients for expensive loops or approximations.
problem Expensive optimization problems with inner loops or approximations.
method Randomized telescoping (RT) gradient estimators.
result RT estimators achieve unbiased gradients independent of loop length or approximation accuracy.
Deep learning identifies precipitation clouds from all-sky camera data.
problem Automating cloud warning systems for observatories.
method Deep learning using EfficientNet network.
result Average accuracy of 99% in identifying rainfall potential and 96% in cloud coverage.
We present a new, fully generative model for constructing astronomical catalogs from optical telescope image sets. Each pixel intensity is treated as a random variable with parameters that depend on the latent properties of stars and galaxies. These latent properties are themselves modeled as random. We compare two pro…
Observations of astrophysical objects such as galaxies are limited by various sources of random and systematic noise from the sky background, the optical system of the telescope and the detector used to record the data. Conventional deconvolution techniques are limited in their ability to recover features in imaging da…
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…
Automated classification of astronomical light curves for LSST.
problem Handling massive astronomical data from LSST.
method Gradient boosting of decision trees, feature extraction and selection, augmentation.
result Achieved one of the top results in the PLAsTiCC challenge.
We prove geometric superrigidity for actions of cocompact lattices in semisimple Lie groups of higher rank on infinite dimensional Riemannian manifolds of nonpositive curvature and finite telescopic dimension.
We present a new, fully generative model of optical telescope image sets, along with a variational procedure for inference. Each pixel intensity is treated as a Poisson random variable, with a rate parameter dependent on latent properties of stars and galaxies. Key latent properties are themselves random, with scientif…
The vision systems of the eagle and the snake outperform everything that we can make in the laboratory, but snakes and eagles cannot build an eyeglass or a telescope or a microscope. (Judea Pearl)
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.
New Roman pipeline detects astronomical transients.
problem Automated detection of transients from Roman Space Telescope data.
method Machine learning model RuBR for distinguishing real from fake detections.
result Effective real-bogus classification in Roman era.
TRE improves density-ratio estimation for highly dissimilar densities.
problem Density-ratio estimation fails for significantly different densities.
method Telescoping density-ratio estimation (TRE) framework.
result TRE yields substantial improvements over existing methods for mutual information estimation.
CNN identifies AGN host galaxies from Sloan Digital Sky Survey data.
problem Identifying AGN host galaxies using traditional methods is time-consuming.
method Trained a convolutional neural network on 210,000 galaxies.
result CNN can distinguish AGN host galaxies from non-active galaxies.
A distributed algorithm learns patterns in large images and signals.
problem High-dimensional optimization in large images and signals.
method Distributed asynchronous algorithm with locally greedy coordinate descent.
result Patterns can be learned on large scales images from the Hubble Space Telescope.
A new coordinate system for SPD matrices simplifies computations and generative modeling.
problem Computing and modeling SPD matrices
method Reverse telescoping coordinate system
result Significantly reduces computational complexity and facilitates generative modeling.
This paper concerns a study of three families of non-compact type symmetric spaces of infinite dimension. Although they have infinite dimension they have finite rank. More precisely, we show they have finite telescopic dimension. We also show the existence of Furstenberg maps for some group actions on these spaces. Suc…
Predicts the age of astronomical transients from real-time data.
problem Improving understanding of transients and their progenitor systems.
method Bayesian probabilistic recurrent neural network.
result Accurately predicts the age of transients with robust uncertainties.
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 -polynomial of twist knots. Our multivariable creative telescoping method allows us to compute linear recursions for sums of …
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.
Develops a new method for equivariant Lagrangian Floer homology using symplectic homotopy quotients.
problem Constructing equivariant Lagrangian Floer homology for symplectic manifolds with group actions.
method Using symplectic homotopy quotients involving cotangent bundles of an approximation of , and Wehrheim and Woodward's theory of quilts.
result Shows that the constructed groups are independent of auxiliary choices and are -bimodules.
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.
New algorithm separates sparse sources from Poisson measurements.
problem Blind source separation of sparse sources from Poisson measurements.
method pGMCA algorithm for Poisson measurements.
result Recovery of sparse sources from Poisson measurements.
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.
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%.
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 definable content of homological invariants II: Čech cohomology and homotopy classificationmath.LO
New cohomology functors refine classical invariants of homotopy types.
problem Classifying maps between specific spaces up to homotopy.
method Descriptive set theory applied to Čech cohomology.
result Definable cohomology functors are complete invariants of homotopy types.
In this paper we propose a problem-driven scenario generation approach to the single-period portfolio selection problem which use tail risk measures such as conditional value-at-risk. Tail risk measures are useful for quantifying potential losses in worst cases. However, for scenario-based problems these are problemati…
New technique shows any group can be a map's automorphism.
problem Finding maps with any given automorphism group.
method Universal technique for showing any finite automorphism group is possible.
result Any finite automorphism group can be realized by many non-isomorphic maps.
New result on group actions in CAT(0) spaces with vanishing escape rate.
problem Understanding group actions with vanishing escape rate on CAT(0) spaces.
method Equivariant -harmonic map proof.
result Existence of a flat subspace invariant under the action of .
Topological normal generation proved for mapping class groups of certain surfaces.
problem Proving topological normal generation for mapping class groups of surfaces.
method Analyzing the end space of surfaces and using topological normal closure properties.
result Topological normal generation is equivalent to uniquely self-similar for surfaces with countable end space.
Deep learning model detects and flags artefacts in polarimetric images.
problem Artifacts in polarimetric images contaminate areas of interest.
method Convolutional Neural Network (CNN) for automatic artefact detection.
result Model achieves 98% true positive and 97% true negative rates.
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.
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.
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.
A new MCMC method combines low and high-fidelity models to reduce computation.
problem Inefficient computation of expensive target densities in scientific applications.
method Pseudo-marginal MCMC approach using a telescoping series of low-fidelity models.
result Asymptotically exact multi-fidelity MCMC algorithms for reduced computational cost.
Astrophysics and cosmology are rich with data. The advent of wide-area digital cameras on large aperture telescopes has led to ever more ambitious surveys of the sky. Data volumes of entire surveys a decade ago can now be acquired in a single night and real-time analysis is often desired. Thus, modern astronomy require…
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…
Steenrod homotopymath.AT
Steenrod homotopy theory is a framework for doing algebraic topology on general spaces in terms of algebraic topology of polyhedra; from another viewpoint, it studies the topology of the lim^1 functor (for inverse sequences of groups). This paper is primarily concerned with the case of compacta, in which Steenrod homot…