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,742 papers · 148 categories

Trend · papers per month

20406080 · Jun 202619922001200920172026
48 results for Silent Singularities

Develops geometric framework for analyzing big bang singularities without symmetry assumptions.

problem Analyzing big bang singularities without symmetry constraints.
method Geometric framework combined with Einstein's equations.
result Partial improvements of assumptions on expansion normalised Weingarten map and convergence of K\mathcal{K}.

The wave trace of certain convex domains can be smooth near some points in the length spectrum.

problem Understanding the relationship between the wave trace and the length spectrum of convex domains.
method Constructing silent periodic billiard orbits with the same length but different Maslov indices, using a microlocal parametrix for wave invariants.
result The wave trace can be smooth near some points in the length spectrum, showing potential limitations for inverse spectral problems.

Silent abandonment reduces contact center efficiency by 5%-15%.

problem Measuring customer abandonment and patience in text-based contact centers is challenging due to uncertainty.
method Developed methodologies to identify silent-abandonment customers and estimate customer patience using text analysis and queueing models.
result Silent abandonment accounts for 30%-67% of customer abandonments and reduces system efficiency by 5%-15%.

Neural networks can learn kernel machines with a data-dependent kernel.

problem Can neural networks in the rich feature learning regime learn a kernel machine?
method Demonstrated silent alignment effect in neural networks, showing they can learn a kernel machine with a data-dependent kernel.
result Neural networks in the rich feature learning regime can learn a kernel machine with a data-dependent kernel due to silent alignment.

This paper maps the insurability of AI risks across various insurance products.

problem Emerging AI risks and their implications for insurance coverage.
method Coding 55 AI threat classes against 26 insurance products using public carrier materials and threat catalogs.
result Identification of a four-tier insurability frontier: affirmatively insured, silent-AI exposures, actively excluded, and unstructured perils.

Lipreading has a lot of potential applications such as in the domain of surveillance and video conferencing. Despite this, most of the work in building lipreading systems has been limited to classifying silent videos into classes representing text phrases. However, there are multiple problems associated with making lip…

2019-06-28abs ↗pdf ↗

New algorithm estimates eigenspace with faulty nodes, matching performance of existing methods.

problem Estimating eigenspace in distributed systems with node failures.
method Develops an eigenspace estimation algorithm for distributed environments with arbitrary node failures.
result Matches performance of existing non-robust estimator up to an additive error.

Diverging Flows detects extrapolations in flow models, ensuring reliable predictions.

problem Flow models extrapolate into invalid data, leading to silent failures.
method Structurally enforce inefficient transport for off-manifold inputs.
result Effective detection of extrapolations without compromising predictive fidelity or inference latency.

Deep learning maps tongue movements to speech sounds for voiceless individuals.

problem Developing silent speech interfaces for individuals without a larynx.
method Hybrid spatio-temporal 3D convolutions and feature shuffling for formant estimation and tracking from ultrasound tongue images.
result Best model achieves R-squared of 99.96% for vowel formant regression.

Markov Chain Monte Carlo (MCMC) algorithms are a workhorse of probabilistic modeling and inference, but are difficult to debug, and are prone to silent failure if implemented naively. We outline several strategies for testing the correctness of MCMC algorithms. Specifically, we advocate writing code in a modular way, w…

2014-12-16abs ↗pdf ↗

The study proposes a framework to accept OOD data based on competence scores.

problem Silent failures in Domain Generalization where models reject OOD data without proper justification.
method A learning to reject framework using proxy incompetence scores to predict trustworthiness.
result Increasing incompetence scores are predictive of reduced accuracy, but not always favorable for accuracy/rejection trade-off.

PIVOT bridges Black-Scholes price and implied volatility spaces via a differentiable layer.

problem Lack of a differentiable interface between price and implied volatility spaces.
method Develops PIVOT, a differentiable layer that preserves LBR's forward pass and avoids backpropagation through branch logic, addressing singularity issues.
result PIVOT achieves high performance and accuracy, reducing price and implied volatility errors by up to 43.4% and 21.3% respectively.

Study uses machine learning and survival analysis to predict CKD progression.

problem Early detection and management of CKD to reduce ESRD risk.
method Combines machine learning and classical statistical models to identify novel CKD progression predictors.
result Deep learning models outperform other methods in predicting CKD progression.

Semi-supervised learning algorithms typically construct a weighted graph of data points to represent a manifold. However, an explicit graph representation is problematic for neural networks operating in the online setting. Here, we propose a feed-forward neural network capable of semi-supervised learning on manifolds w…

2019-08-21abs ↗pdf ↗

Bayesian approach improves uncertainty in deep learning models.

problem Uncertainty quantification in deep learning models.
method Bayesian point of view, Gaussian approximability, semi-parametric Bernstein-von Mises theorems.
result Bayesian credible regions have valid frequentist coverage, providing theoretical justification for deep learning.

This work improves neural network trustworthiness through uncertainty estimation.

problem Overconfident neural networks lead to poor performance under distribution shifts.
method Develops a general uncertainty framework for neural networks, including classification with rejection.
result Improves model trustworthiness and robustness in decision-making tasks.

Machine learning models fail due to concept and data drift during pandemic.

problem Machine learning models trained before the pandemic are unreliable during the pandemic.
method Detect and diagnose concept and data drift in models.
result Model resilience and robustness are crucial for future predictions.

Unified framework detects overfitting in crash classification models.

problem Evaluation metrics fail to detect overfitting in crash classification models.
method Random Matrix Theory and Heavy-Tailed Self-Regularization framework applied to various model types.
result Power-law exponent α reliably distinguishes well-regularized from overfit models.

Confidence bands for tuning curves improve hyperparameter comparison in NLP.

problem Ambiguity in comparing hyperparameter tuning methods.
method Constructs exact, simultaneous, and distribution-free confidence bands for tuning curves.
result Confidence bands provide a robust basis for comparing methods rigorously.

Regularization and data augmentation can be class-dependent, leading to poor performance on some classes.

problem Class-dependent effects of regularization and data augmentation.
method Evaluation of regularization and data augmentation techniques on Imagenet and INaturalist datasets.
result Regularization and data augmentation can lead to significant performance drops on some classes.

Three training methods for language models are shown to be variations of one another.

problem Training language models to reason effectively using different methods.
method Three training methods: GRPO, Dr. GRPO, and DAPO.
result All three methods adjust a single number: standard deviation, measuring disagreement in answers.

Study describes singularities of height functions on specific singular surfaces.

problem Analyzing singularities of height functions on singular surfaces.
method Using geometric language and blowing-ups, investigate singularities of height functions and dual surfaces.
result Characterized singularities of height functions and dual surfaces on specific singular surfaces.

The paper extends affine connection results to singular warped and twisted products.

problem Generalizing affine connections to singular warped and twisted products.
method Study of singular multiply warped products and singular twisted products with semi-symmetric metric and non-metric connections, discussing Koszul forms and curvature.
result Theoretical results on curvature and Koszul forms for singular multiply warped and twisted products.

Study describes singularities of distance squared functions on singular surfaces.

problem Characterizing singularities of distance squared functions on singular surfaces.
method Using smooth map-germs SkS_k, BkB_k, CkC_k, and F4F_4 singularities, the study describes singularities via blowing-ups.
result Characterization of singularities of wave-fronts and caustics of singular surfaces.

In this paper, we define the set of singular grid diagrams SG\mathcal{SG} which provides a unified description for singular links, singular Legendrian links, singular transverse links, and singular braids. We also classify the complete set of all equivalence relations on SG\mathcal{SG} which induce the bijection onto e…

2017-08-12abs ↗pdf ↗

Proves positive mass theorem for AF spin manifolds with conical singularities.

problem Proving the positive mass theorem for singular metrics on AF manifolds.
method Analyzes AF spin manifolds with isolated conical singularities, allowing topological singularities.
result Proves the positive mass theorem for AF spin manifolds with conical singularities.

The study examines singularities and geometric properties of surfaces derived from frontals with specific singular points.

problem Characterizing and understanding the singularities and geometric properties of surfaces formed by the singular loci of normal congruences of frontals with pure-frontal singular points.
method Characterizations of singularities in terms of geometric invariants of the initial frontal are provided for the normal ruled surface. Relations between certain singularities of focal surfaces and geometric properties of the frontal are also explored.
result Behavior of Gaussian curvature of focal surfaces of frontals with a 5/25/2-cuspidal edge is considered.

Rectifies flat singular points of area-minimizing currents with singularity degree > 1.

problem Rectifying flat singular points of area-minimizing currents with singularity degree > 1.
method Subdividing singular points based on singularity degree and proving rectifiability of points with singularity degree > 1.
result The set of points with singularity degree > 1 is (m-2)-rectifiable.

The paper studies singularities of pedal curves of hyperbolic frontals.

problem Investigating singularities of pedal curves of spacelike frontals in hyperbolic 2-space.
method Analyzing singularities of pedal curves based on dual curve germs and pedal point locations.
result The singularities of pedal curves depend on the singularities of the first hyperbolic Legendrian curvature germ and the pedal point for non-singular dual curve germs. For singular dual curve germs, additional dependence on both Legendrian curvature germs is observed.

The paper extends deformation theory to Calabi-Yau varieties with isolated log canonical singularities.

problem Deformation theory of Calabi-Yau varieties with log canonical singularities.
method Study of higher Du Bois and rational singularities, focusing on 0-liminal singularities.
result Existence of first order smoothings for isolated 0-liminal hypersurface singularities.