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.
Paper proposes a framework to detect distribution shifts using embedding space geometry.
problem Detecting distribution shifts in candidate datasets to improve model generalizability.
method Non-parametric framework using embedding space geometry for two tests: robustness boundary and in-distribution/out-of-distribution classification.
result Both tests successfully detect distribution shifts in various scenarios for both synthetic and real-world datasets.
We propose Zeno++, a new robust asynchronous Stochastic Gradient Descent~(SGD) procedure which tolerates Byzantine failures of the workers. In contrast to previous work, Zeno++ removes some unrealistic restrictions on worker-server communications, allowing for fully asynchronous updates from anonymous workers, arbitrar…
Modern statistical applications involving large data sets have focused attention on statistical methodologies which are both efficient computationally and able to deal with the screening of large numbers of different candidate models. Here we consider computationally efficient variational Bayes approaches to inference …
This paper is about the relation of the geometry of Lie groupoids over a fixed compact manifold and the geometry of their (infinite-dimensional) bisection Lie groups. In the first part of the paper we investigate the relation of the bisections to a given Lie groupoid, where the second part is about the construction of …
Forecasting technological progress is of great interest to engineers, policy makers, and private investors. Several models have been proposed for predicting technological improvement, but how well do these models perform? An early hypothesis made by Theodore Wright in 1936 is that cost decreases as a power law of cumul…
Multi-armed bandits are a quintessential machine learning problem requiring the balancing of exploration and exploitation. While there has been progress in developing algorithms with strong theoretical guarantees, there has been less focus on practical near-optimal finite-time performance. In this paper, we propose an …
Alzheimer's disease (AD) is the most common neurodegenerative disease in older people. Despite considerable efforts to find a cure for AD, there is a 99.6% failure rate of clinical trials for AD drugs, likely because AD patients cannot easily be identified at early stages. This project investigated machine learning app…
The search for higher-order feature interactions that are statistically significantly associated with a class variable is of high relevance in fields such as Genetics or Healthcare, but the combinatorial explosion of the candidate space makes this problem extremely challenging in terms of computational efficiency and p…
Deep object detection improves mitotic nucleus detection in breast cancer biopsies.
problem Challenges in automated mitotic nucleus detection in breast cancer histopathological images.
method Adapted Mask R-CNN for deep object detection, initially selects candidate regions with maximum recall, refines them with multi-object loss function.
result Improved discrimination ability (F-score of 0.86) and significant precision (0.86) for mitotic nuclei compared to two-stage models.
The paper proposes a new method to estimate interest rates consistently under both risk-neutral and real-world measures.
problem Consistent estimation of interest rates under both risk-neutral and real-world measures.
method Proposes a framework using progressive and square-integrable functions to specify the change of measure, and introduces two time-dependent candidates: step and linear functions.
result The proposed methods produce more stable and realistic long-term interest rate forecasts compared to using a constant function.
To a branched cover between closed, connected and orientable surfaces one associates a "branch datum", which consists of the two surfaces, the total degree d, and the partitions of d given by the collections of local degrees over the branching points. This datum must satisfy the Riemann-Hurwitz formula. A "candidate su…
In this article, we investigate when the set of primitive geodesic lengths on a Riemannian manifold have arbitrarily long arithmetic progressions. We prove that in the space of negatively curved metrics, a metric having such arithmetic progressions is quite rare. We introduce almost arithmetic progressions, a coarsific…
This paper proposes a method for multi-class classification problems, where the number of classes K is large. The method, referred to as Candidates vs. Noises Estimation (CANE), selects a small subset of candidate classes and samples the remaining classes. We show that CANE is always consistent and computationally effi…
The paper analyzes how employers can efficiently screen candidates using multiple tests, considering both skill estimation and fairness.
problem How to efficiently screen candidates using multiple noisy signals without violating fairness.
method The paper extends traditional screening models to a multi-test setting, analyzing optimal employer policies for both fixed and dynamic test assignments.
result A fundamental impossibility emerges when noise levels vary across groups, making it impossible to administer the same number of tests and maintain the same outcomes.
Simulated annealing improves candidate optimization for multi-objective Bayesian optimization.
problem Efficient candidate optimization for multi-objective acquisition functions in Bayesian optimization.
method Simulated annealing-based approach for batch acquisition function optimization.
result Simulated annealing outperforms SLSQP in most multi-objective optimization problems, achieving higher hypervolume values and better convergence characteristics.
For a branched cover between two closed orientable surfaces, the Riemann-Hurwitz formula relates the Euler characteristics of the surfaces, the total degree of the cover, and the total length of the partitions of the degree given by the local degrees at the preimages of the branching points. A very old problem asks whe…