Constraint-based causal discovery (CCD) algorithms require fast and accurate conditional independence (CI) testing. The Kernel Conditional Independence Test (KCIT) is currently one of the most popular CI tests in the non-parametric setting, but many investigators cannot use KCIT with large datasets because the test sca…
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.
Trend · papers per month
Estimates peeking effects in p-values to correct bias.
Study confirms Indian stock market is weak form inefficient.
Testing the implementation of deep learning systems and their training routines is crucial to maintain a reliable code base. Modern software development employs processes, such as Continuous Integration, in which changes to the software are frequently integrated and tested. However, testing the training routines requir…
SGD-trained models' disagreement predicts test error.
A new protocol evaluates small machine learning improvements conservatively.
We test for the long-run relationship between stock prices, inflation and its uncertainty for different U.S. sector stock indexes, over the period 2002M7 to 2015M10. For this purpose we use a cointegration analysis with one structural break to capture the crisis effect, and we assess the inflation uncertainty based on …
CTT compresses samples to test distributions near-linearly, outperforming existing methods.
Cheap permutation tests speed up distribution testing without sacrificing accuracy.
Statistical test verifies long-term rating system calibration with overlapping time windows.
A new test statistic counts tree co-occurrences to detect edge correlation between networks.
The study finds a long-term relationship between Dubai crude oil and US natural gas prices.
New statistics improve kernel independence testing efficiency.
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…
We propose an alternative framework to existing setups for controlling false alarms when multiple A/B tests are run over time. This setup arises in many practical applications, e.g. when pharmaceutical companies test new treatment options against control pills for different diseases, or when internet companies test the…
Bayesian optimization for long-term outcomes using fast and slow experiments.
This paper analyzes the process of long-run co-movements and stock market globalization on the basis of cointegration tests and vector error correction (VEC) models. The cointegration tests used here allow for structural breaks to be explicitly modeled and breakpoints to be computed on a relative-time basis. The data u…
We implement a Tensor Train layer in the TensorFlow Neural Machine Translation (NMT) model using the t3f library. We perform training runs on the IWSLT English-Vietnamese '15 and WMT German-English '16 datasets with learning rates , maximum ranks and a range of core dime…
The paper introduces a diagnostic method to detect grokking transitions in models before test accuracy improves.
Automated tests detect interactions in unstructured data.
In this paper we investigate the adaptive market efficiency of the agricultural commodity futures market, using a sample of eight futures contracts. Using a battery of nonlinear tests, we uncover the nonlinear serial dependence in the returns series. We run the Hinich portmanteau bicorrelation test to uncover the momen…
In this paper, we present our approach to solve a physics-based reinforcement learning challenge "Learning to Run" with objective to train physiologically-based human model to navigate a complex obstacle course as quickly as possible. The environment is computationally expensive, has a high-dimensional continuous actio…
Aioli unifies language model data mixing methods and improves performance.
New measure assesses neural network models' functional similarity.
Bayesian method improves adaptive testing item selection, ensuring full item exposure.
SEFR is a fast, energy-efficient classifier for ultra-low power devices.
We consider the problem of configuring general-purpose solvers to run efficiently on problem instances drawn from an unknown distribution. The goal of the configurator is to find a configuration that runs fast on average on most instances, and do so with the least amount of total work. It can run a chosen solver on a r…
Data that is gathered adaptively --- via bandit algorithms, for example --- exhibits bias. This is true both when gathering simple numeric valued data --- the empirical means kept track of by stochastic bandit algorithms are biased downwards --- and when gathering more complicated data --- running hypothesis tests on c…
New method measures model variability from stochastic optimization.
This paper studies an intelligent ultimate technique for health-monitoring and prognostic of common rotary machine components, particularly bearings. During a run-to-failure experiment, rich unsupervised features from vibration sensory data are extracted by a trained sparse auto-encoder. Then, the correlation of the ex…
DeFi doesn't fully remove trust, showing run risk and personal character's importance.
Linear-time graph optimization using reinforcement learning.
A simple algorithm for Gaussian mean testing with optimal sample complexity.
A new computationally efficient dependence measure, and an adaptive statistical test of independence, are proposed. The dependence measure is the difference between analytic embeddings of the joint distribution and the product of the marginals, evaluated at a finite set of locations (features). These features are chose…
Pareto Testing optimizes model performance under multiple constraints.
In this paper, a modification to the training process of the popular SPLICE algorithm has been proposed for noise robust speech recognition. The modification is based on feature correlations, and enables this stereo-based algorithm to improve the performance in all noise conditions, especially in unseen cases. Further,…
Unified model for network risks, including bilateral and central clearing, with practical applications.
AutoPC optimizes hyperparameters for the PC algorithm to improve its performance.
As machine learning algorithms enter applications in industrial settings, there is increased interest in controlling their cpu-time during testing. The cpu-time consists of the running time of the algorithm and the extraction time of the features. The latter can vary drastically when the feature set is diverse. In this…
Securely trains fair models using homomorphic encryption.
This study applies old and new generations of panel unit root tests to test the validity of long-run real interest rate parity (RIP) hypothesis for ten Central and Eastern European Countries (CEECs) with respect to the Euro area and an average of the CEECs' real interest rates, respectively. When the panel unit root te…
Active testing for large language models is made more efficient and accurate.
We show that several popular few-shot learning benchmarks can be solved with varying degrees of success without using support set Labels at Test-time (LT). To this end, we introduce a new baseline called Centroid Networks, a modification of Prototypical Networks in which the support set labels are hidden from the metho…
GTBO uses group testing to optimize high-dimensional functions efficiently.
New test for SGD in binary classification reduces computation time.
Spectral Adaptive Conformal Prediction for Structured Non-Exchangeable Data
New method tests independence with single nonstationary time series.
We present an efficient algorithm for simultaneously training sparse generalized linear models across many related problems, which may arise from bootstrapping, cross-validation and nonparametric permutation testing. Our approach leverages the redundancies across problems to obtain significant computational improvement…