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

Trend · papers per month

1223 · Oct 202019922001200920172026
48 results for doubt

Using very weak criteria for what may constitute a noncommutative geometry, I show that a pseudo-Riemannian manifold can only be smoothly deformed into noncommutative geometries if certain geometric obstructions vanish. These obstructions can be expressed as a system of partial differential equations relating the metri…

2002-11-13abs ↗pdf ↗

According to the definition of the London Interbank Offered Rate (LIBOR), contributing banks should give fair estimates of their own borrowing costs in the interbank market. Between 2007 and 2009, several banks made inappropriate submissions of LIBOR, sometimes motivated by profit-seeking from their trading positions. …

2015-08-19abs ↗pdf ↗

Two classes of gamma-ray bursts (GRBs), short and long, have been determined without any doubts, and are usually ascribed to different progenitors, yet these classes overlap for a variety of descriptive parameters. A subsample of 46 long and 22 short FermiFermi GRBs with estimated Hurst Exponents (HEs), complemented by mi…

2015-07-17abs ↗pdf ↗

Weight decay is one of the standard tricks in the neural network toolbox, but the reasons for its regularization effect are poorly understood, and recent results have cast doubt on the traditional interpretation in terms of L2L_2 regularization. Literal weight decay has been shown to outperform L2L_2 regularization for…

2018-10-29abs ↗pdf ↗

Diffusion models achieve nearly optimal distribution estimation in various spaces.

problem Theoretical limitations of diffusion modeling for distribution estimation.
method Analysis of approximation and generalization abilities of diffusion models in Besov spaces.
result Diffusion models achieve nearly minimax optimal estimation rates in total variation and Wasserstein distances.

The biological plausibility of the backpropagation algorithm has long been doubted by neuroscientists. Two major reasons are that neurons would need to send two different types of signal in the forward and backward phases, and that pairs of neurons would need to communicate through symmetric bidirectional connections. …

2018-08-14abs ↗pdf ↗

This paper is a sequel of "Solvable symmetric black hole in anti de Sitter spaces" [arXiv:math.DG/0510442]. In the latter, we described the BTZ black hole in every dimension by defining the singularity as the closed orbits of the Iwasawa subgroup of SO(2,n). In this article, we study the horizon of the black hole and w…

2009-12-11abs ↗pdf ↗

Recent years have witnessed widespread adoption of machine learning (ML)/deep learning (DL) techniques due to their superior performance for a variety of healthcare applications ranging from the prediction of cardiac arrest from one-dimensional heart signals to computer-aided diagnosis (CADx) using multi-dimensional me…

2020-01-21abs ↗pdf ↗

The repeated community-wide reuse of test sets in popular benchmark problems raises doubts about the credibility of reported test-error rates. Verifying whether a learned model is overfitted to a test set is challenging as independent test sets drawn from the same data distribution are usually unavailable, while other …

2019-03-06abs ↗pdf ↗

The first part of this article intends to present the role played by Thom in diffusing Smale's ideas about immersion theory, at a time (1957) where some famous mathematicians were doubtful about them: it is clearly impossible to make the sphere inside out! Around a decade later, M. Gromov transformed Smale's idea in wh…

2017-03-23abs ↗pdf ↗

New findings suggest non-contrastive learning has many bad minima, not just collapsed ones.

problem The effectiveness of non-contrastive learning in unsupervised feature learning.
method Theoretical analysis and controlled experiments on simple data models.
result Non-contrastive losses have a preponderance of non-collapsed bad minima, and these minima are not avoided during training.

Study reveals limitations of fair representation learning methods and cautions against their use in performance-sensitive tasks.

problem Limitations of fair representation learning methods in performance-sensitive tasks.
method Using causal reasoning, the study defines and formalizes different sources of dataset bias and examines the performance of fair representation learning under distribution shifts.
result Fundamental limitations on fair representation learning when evaluation data is drawn from the same distribution as training data.

This paper suggests claim history will be deprecated in future auto insurance rates.

problem The role of historical claim records in auto insurance rates.
method Proposes a new risk variable elimination method and real-time road risk model design.
result Claim history will be considered a 'noise' factor and deprecated in Pay-How-You-Drive models.

Paper proposes a new Autoencoder for robustly encoding white matter streamlines.

problem Limited Autoencoder architectures ignore global streamline geometry and lack interpretability.
method Introduces Differentiable Vector Quantized Variational Autoencoder (D-VQ-VAE) for entire streamline bundles.
result Demonstrates superior performance in encoding and synthesis compared to state-of-the-art Autoencoders.

e-Yantra Robotics Competition (eYRC) is a unique Robotics Competition hosted by IIT Bombay that is actually an Embedded Systems and Robotics MOOC. Registrations have been growing exponentially in each year from 4500 in 2012 to over 34000 in 2019. In this 5-month long competition students learn complex skills under seve…

2019-11-15abs ↗pdf ↗

This work identifies and mitigates reasoning shortcuts in Neuro-Symbolic models.

problem Neuro-Symbolic models can achieve high accuracy by using unintended concepts.
method Characterized reasoning shortcuts as unintended optima of the learning objective and identified four key conditions.
result Reasoning shortcuts are difficult to mitigate, casting doubt on NeSy solutions' trustworthiness and interpretability.

Deep ResNets exhibit distinct scaling properties with depth, challenging neural ODE models.

problem Understanding the scaling properties of deep ResNets and their relation to neural ODEs.
method Detailed numerical experiments on weights trained by stochastic gradient descent.
result Deep ResNets can exhibit different scaling regimes, including stochastic differential equations or neither, challenging the neural ODE model.

Study compares adversarial regularization to sole supervision in machine learning.

problem Understanding when adversarial regularization outperforms sole supervision.
method Examines vanishing gradient, iteration complexity, gradient flow, and convergence in both paradigms.
result Adversarial regularization accelerates gradient descent and improves generalization.

Interpreting predictions from tree ensemble methods such as gradient boosting machines and random forests is important, yet feature attribution for trees is often heuristic and not individualized for each prediction. Here we show that popular feature attribution methods are inconsistent, meaning they can lower a featur…

2018-02-12abs ↗pdf ↗

Study validates ML-UQ calibration statistics using simulated reference values.

problem Validation of ML-UQ calibration statistics is lacking due to lack of predefined reference values.
method Proposed validation workflow using simulated reference values derived from synthetic datasets.
result Some statistics, like CC and ENCE, are overly sensitive to generative distribution choice.

New tuning rules for Metropolis algorithms derived from Bayesian large-sample asymptotics.

problem Optimal scaling in random-walk Metropolis algorithms under realistic assumptions.
method Large-sample asymptotics to derive weak convergence results and tuning guidelines.
result Tuning guidelines consistent with previous ones when target density is product form, accounting for correlation structure.

Recently, the efficiency of automatic neural architecture design has been significantly improved by gradient-based search methods such as DARTS. However, recent literature has brought doubt to the generalization ability of DARTS, arguing that DARTS performs poorly when the search space is changed, i.e, when different s…

2019-09-26abs ↗pdf ↗

Heteroskedasticity biases uplift model rankings, leading to inefficient treatment allocation.

problem Bias in uplift model rankings due to heteroskedasticity.
method Theoretical analysis and simulation on real-world data.
result Heteroskedasticity can cause individuals with high treatment effects to be ranked at the bottom, leading to inefficient treatment allocation.

This paper poses some basic questions about instances (hard to find) of a special problem in 3-manifold topology. "Important though the general concepts and propositions may be with the modern industrious passion for axiomatizing and generalizing has presented us ... nevertheless I am convinced that the special problem…

2013-05-12abs ↗pdf ↗

Authorship verification (AV) is a research subject in the field of digital text forensics that concerns itself with the question, whether two documents have been written by the same person. During the past two decades, an increasing number of proposed AV approaches can be observed. However, a closer look at the respect…

2019-06-24abs ↗pdf ↗

During the past five years the Bayesian deep learning community has developed increasingly accurate and efficient approximate inference procedures that allow for Bayesian inference in deep neural networks. However, despite this algorithmic progress and the promise of improved uncertainty quantification and sample effic…

2020-02-06abs ↗pdf ↗

The study tests inferences about neural network optimization from linear interpolation of loss landscapes.

problem Understanding the difficulty of neural network optimization problems.
method Linear interpolation of neural network loss landscapes, systematic evaluation of various factors.
result Linear interpolation does not correlate with model performance, challenging prior intuition.

New findings show neural networks can be fooled by adversarial data, but a simple bias fix works.

problem Neural networks can be misled by adversarial data, rendering existing generalization bounds ineffective.
method Extensive theoretical investigation of a specific dataset using infinitely-wide models, focusing on the Neural Tangent Kernel (NTK).
result A sensible choice of output bias completely mitigates the adversarial phenomenon, revealing phase transitions in accuracy.