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

4489133177 · Jun 202019922001200920172026
48 results for étale maps

Anabelian geometry reformulated using Hodge theory for hyperbolic curves.

problem Determining varieties over number fields using their étale fundamental groups.
method Formulating a Hodge-theoretic version of anabelian conjecture, replacing Galois action with Cimes\mathbb{C}^ imes-action.
result Proved a Hodge-theoretic analog of Mochizuki's theorem for smooth projective hyperbolic curves over C\mathbb{C}.

Tangle machines are a topologically inspired diagrammatic formalism to describe information flow in networks. This paper begins with an expository account of tangle machines motivated by the problem of describing `covariance intersection' fusion of Gaussian estimators in networks. It then gives two examples in which ta…

2015-11-16abs ↗pdf ↗

An orbifold is a Morita equivalence class of a proper {\' e}tale Lie groupoid. A unitary equivalence class of spectral triples over the algebra of smooth invariant functions are associated with any compact spin orbifold. In the case of an effective spin orbifold we construct a collection of spectral triples over the sm…

2014-05-28abs ↗pdf ↗

We consider the partial observability model for multi-armed bandits, introduced by Mannor and Shamir. Our main result is a characterization of regret in the directed observability model in terms of the dominating and independence numbers of the observability graph. We also show that in the undirected case, the learner …

2013-07-17abs ↗pdf ↗

This paper investigates arbitrage chains involving four currencies and four foreign exchange trader-arbitrageurs. In contrast with the three-currency case, we find that arbitrage operations when four currencies are present may appear periodic in nature, and not involve smooth convergence to a "balanced" ensemble of exc…

2011-12-26abs ↗pdf ↗

Feature selection from wide datasets leads to misleading results.

problem Feature selection in wide datasets with few samples can lead to misleading results.
method Derived sample size requirement for declaring features different, used real datasets to illustrate issues.
result Feature selection from very wide datasets may lead to misleading results.

Two types of differentials are shown equivalent for compactifying moduli spaces.

problem Compactifying moduli spaces of curves with prescribed orders of zeros and poles.
method Equivalence of multi-scale and logarithmic differentials, isomorphism of moduli stacks, explicit blowups.
result Multi-scale and logarithmic differentials are equivalent and isomorphic.

The paper explores tail diversification in financial markets using entropy and mutual information.

problem Tail diversification in financial time series.
method Statistical independence through differential entropy and mutual information, using moments as contrast functions.
result Tail covariance matrix is a key driver of tail diversification.

Framework combines adversarial training and provable robustness for neural networks.

problem Training certifiably robust neural networks with provable robustness guarantees.
method Formulates joint optimization problem with adversarial and provable robustness objectives; develops gradient-descent technique.
result Consistently matches or outperforms prior approaches for provable l infinity robustness on MNIST and CIFAR-10.

Lecture notes on linear neural networks for deep learning optimization and generalization.

problem Understanding optimization and generalization in deep learning models.
method Mathematical tools and dynamical systems theory.
result Potential of mathematical tools to enhance understanding of deep learning.

HIVE-COTE v1.0 improves time series classification with enhanced usability.

problem Improving time series classification accuracy and usability.
method Presented a walkthrough guide and extensive experimental evaluation of HIVE-COTE v1.0.
result HIVE-COTE v1.0 outperforms three recently proposed algorithms in predictive performance and resource usage.

In healthcare, patient risk stratification models are often learned using time-series data extracted from electronic health records. When extracting data for a clinical prediction task, several formulations exist, depending on how one chooses the time of prediction and the prediction horizon. In this paper, we show how…

2018-11-29abs ↗pdf ↗

Integration of the form af(x)w(x)dx\int_a^\infty {f(x)w(x)dx} , where w(x)w(x) is either sin(ωx)\sin (ω{\kern 1pt} x) or cos(ωx)\cos (ω{\kern 1pt} x), is widely encountered in many engineering and scientific applications, such as those involving Fourier or Laplace transforms. Often such integrals are approximated by a numerical integration…

2010-05-11abs ↗pdf ↗

For any Lie groupoid we construct an analytic index morphism taking values in a modified KtheoryK-theory group which involves the convolution algebra of compactly supported smooth functions over the groupoid. The construction is performed by using the deformation algebra of smooth functions over the tangent groupoid constru…

2008-03-13abs ↗pdf ↗

Dynamic pricing improves DeFi lending efficiency by reducing regret to logarithmic levels.

problem Static pricing mechanisms in DeFi lending protocols lead to suboptimal welfare and revenue.
method Online learning model for static and dynamic pricing models in DeFi lending.
result Adaptive supply models achieve logarithmic regret, outperforming static models.

Researchers expand on best subset selection theory, identifying key complexities.

problem Understanding model selection performance in high-dimensional sparse linear regression.
method Analyzing residualized signals, orthogonality, and spurious projections to establish margin conditions.
result Established necessary and sufficient margin conditions for BSS model consistency.

Modern classification problems frequently present mild to severe label imbalance as well as specific requirements on classification characteristics, and require optimizing performance measures that are non-decomposable over the dataset, such as F-measure. Such measures have spurred much interest and pose specific chall…

2015-05-26abs ↗pdf ↗

This work develops a unified framework for RLHF with general ff-divergence regularization.

problem Theoretical understanding of general ff-divergence regularization in RLHF.
method Holistic approach across ff-divergence class, two algorithms based on distinct sampling principles.
result Provably efficient algorithms with O(logT)O(\log T) regret and O(1/T)O(1/T) sub-optimality gap.

The paper tackles learning from imperfect human feedback, especially in dueling bandit problems.

problem Learning from human feedback that can be irrational or imperfect.
method Developed a Robustified Stochastic Mirror Descent for Imperfect Dueling (RoSMID) algorithm.
result Achieved nearly optimal regret for dueling bandit problems under imperfect human feedback.

State-of-the-art results on image recognition tasks are achieved using over-parameterized learning algorithms that (nearly) perfectly fit the training set and are known to fit well even random labels. This tendency to memorize the labels of the training data is not explained by existing theoretical analyses. Memorizati…

2019-06-12abs ↗pdf ↗

Atoms and molecules are important conceptual entities we invented to understand the physical world around us. The key to their usefulness lies in the organization of nuclear and electronic degrees of freedom into a single dynamical variable whose time evolution we can better imagine. The use of such effective variables…

2009-03-12abs ↗pdf ↗

Quantile regression attacks outperform shadow models in unseen class membership inference attacks.

problem Failure of shadow model attacks on unseen classes due to limited data access.
method Quantile regression attacks that learn features of member examples.
result Quantile regression attacks achieve up to 11x higher TPR than shadow model-based approaches.

Despite their tremendous success in a range of domains, deep learning systems are inherently susceptible to two types of manipulations: adversarial inputs -- maliciously crafted samples that deceive target deep neural network (DNN) models, and poisoned models -- adversely forged DNNs that misbehave on pre-defined input…

2019-11-05abs ↗pdf ↗

New estimate reduces overfitting risk in machine learning models.

problem Error rate on test data may not reflect true population error due to adaptive data analysis practices.
method Introduces Rip van Winkle's Razor, a simple estimate of overfit to test data based on information content.
result Shows non-vacuous estimate of deviation in many modern settings.

A new method learns latent space normalizing flow for approximate inference in generator models.

problem Approximate inference in generator models with complex posterior distributions.
method Jointly learns latent space normalizing flow and generator model using MCMC-based maximum likelihood.
result The short-run Langevin flow approximates the posterior and aligns with the normalizing flow prior.

This study compares transfer learning and self-supervised learning for better model performance.

problem Choosing between transfer learning and self-supervised learning for optimal model performance.
method Comprehensive comparative study of transfer learning and self-supervised learning under various data and task properties.
result Self-supervised learning outperforms transfer learning in certain applications, and vice versa.

This paper investigates multiscaling in the rough Bergomi model, finding it primarily due to fat-tailed returns.

problem Understanding multiscaling in the rough Bergomi model to improve financial modelling and risk management.
method Introducing a two-stage statistical testing procedure: first, testing for multiscaling against uniscaling; second, using shuffled surrogates to preserve return distributions.
result Multiscaling in the rough Bergomi model arises primarily from fat-tailed return distributions, not memory effects.

The study reveals decision trees' limitations in fitting data from additive models, proving a generalization lower bound.

problem Understanding the generalization performance of decision trees on additive models.
method Analyzing decision tree algorithms with sparse additive models, proving generalization lower bounds.
result Generalization lower bounds for decision trees on sparse additive models are much worse than minimax rates.