This study examines the interaction between CDS and stock indices, revealing significant short and long-term impacts.
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
This paper studies a curious phenomenon in learning energy-based model (EBM) using MCMC. In each learning iteration, we generate synthesized examples by running a non-convergent, non-mixing, and non-persistent short-run MCMC toward the current model, always starting from the same initial distribution such as uniform no…
Machine learning improves measuring climate adaptation impacts.
Accurate estimation of the run time of computational codes has a number of significant advantages for scientific computing. It is required information for optimal resource allocation, improving turnaround times and utilization of science gateways. Furthermore, it allows users to better plan and schedule their research,…
Improved canary crafting for one-run privacy auditing reduces leakage estimates.
This paper uses SDEs to analyze GANs training and long-run behavior.
Study shows climate change can cause a 'run on fossil fuels' affecting prices and production.
New framework evaluates MIA without retraining, addressing biases.
Paper analyzes Hit-and-Run's convergence rates and applies similar methods to randomized Kaczmarz.
Study optimal control of diffusion processes with infimum or supremum costs.
Analysis finds no evidence of banks managing deposit run risk prior to 2023 Regional Banking Crisis.
What predicts the evolution over time of subjective well-being? We correlate the trends of subjective well-being with the trends of social capital and/or GDP. We find that in the long and medium run social capital largely predicts the trends of subjective wellbeing in our sample of countries. In the short-term this rel…
Recurrent neural networks can be large and compute-intensive, yet many applications that benefit from RNNs run on small devices with very limited compute and storage capabilities while still having run-time constraints. As a result, there is a need for compression techniques that can achieve significant compression wit…
For organizing large text corpora topic modeling provides useful tools. A widely used method is Latent Dirichlet Allocation (LDA), a generative probabilistic model which models single texts in a collection of texts as mixtures of latent topics. The assignments of words to topics rely on initial values such that general…
In-Run Data Shapley offers efficient data attribution for large-scale models.
Model explains how stablecoin runs are influenced by large sales and reserve quality.
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 …
LLMs fail to match statistical ground truth despite stable run-to-run performance.
We study the portfolio selection problem of a long-run investor who is maximising the asymptotic growth rate of her expected utility. We show that, somewhat surprisingly, it is essentially not affected by introduction of a floor constraint which requires the wealth process to dominate a given benchmark at all times. We…
Trading styles affect long-run variance of asset prices, increasing under trend-following and decreasing under mean-reverting.
Mixed datasets consist of both numeric and categorical attributes. Various k-means-based clustering algorithms have been developed for these datasets. Generally, these algorithms use random partition as a starting point, which tends to produce different clustering results for different runs. In this paper, we propose, …
Improves Monte-Carlo simulations for consistent mean and variance.
This paper develops a method to derive optimal portfolios and risk premia explicitly in a general diffusion model for an investor with power utility and a long horizon. The market has several risky assets and is potentially incomplete. Investment opportunities are driven by, and partially correlated with, state variabl…
Improved SVRG for quadratic functions achieves better performance and running times.
In this work, we address the problem of tuning communication libraries by using a deep reinforcement learning approach. Reinforcement learning is a machine learning technique incredibly effective in solving game-like situations. In fact, tuning a set of parameters in a communication library in order to get better perfo…
Model shows how banks' hidden-to-maturity accounting can mask run risk and lead to financial instability.
The study identifies key factors affecting cryptocurrency prices, including market beta, trading volume, and volatility.
Study uses artificial counterfactuals to show lockdowns reduced US case and death counts.
In the NIPS 2017 Learning to Run challenge, participants were tasked with building a controller for a musculoskeletal model to make it run as fast as possible through an obstacle course. Top participants were invited to describe their algorithms. In this work, we present eight solutions that used deep reinforcement lea…
Study shows HFT benefits large traders under certain conditions.
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…
We conduct an empirical study of machine learning functionalities provided by major cloud service providers, which we call machine learning clouds. Machine learning clouds hold the promise of hiding all the sophistication of running large-scale machine learning: Instead of specifying how to run a machine learning task,…
We propose a novel coding theoretic framework for mitigating stragglers in distributed learning. We show how carefully replicating data blocks and coding across gradients can provide tolerance to failures and stragglers for Synchronous Gradient Descent. We implement our schemes in python (using MPI) to run on Amazon EC…
We study -GenEV, the problem of finding the top generalized eigenvectors, and -CCA, the problem of finding the top vectors in canonical-correlation analysis. We propose algorithms and to solve the two problems with running times linearly dependent on the input size and…
This study investigates the effects of Markov chain Monte Carlo (MCMC) sampling in unsupervised Maximum Likelihood (ML) learning. Our attention is restricted to the family of unnormalized probability densities for which the negative log density (or energy function) is a ConvNet. We find that many of the techniques used…
In the paper portfolio optimization over long run risk sensitive criterion is considered. It is assumed that economic factors which stimulate asset prices are ergodic but non necessarily uniformly ergodic. Solution to suitable Bellman equation using local span contraction with weighted norms is shown. The form of optim…
Edge language models show bias over time, especially on resource-constrained devices.
Investigates long-term performance of multi-fidelity Bayesian optimization.
This paper develops coding techniques to reduce the running time of distributed learning tasks. It characterizes the fundamental tradeoff to compute gradients (and more generally vector summations) in terms of three parameters: computation load, straggler tolerance and communication cost. It further gives an explicit c…
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…
The online problem of computing the top eigenvector is fundamental to machine learning. In both adversarial and stochastic settings, previous results (such as matrix multiplicative weight update, follow the regularized leader, follow the compressed leader, block power method) either achieve optimal regret but run slow,…
A new method learns latent space normalizing flow for approximate inference in generator models.
Efficiently learns complex Boolean functions under Gaussian distributions.
We propose an algorithm, HPREF (Hierarchical Partitioning by Repeated Features), that produces a hierarchical partition of a set of clusterings of a fixed dataset, such as sets of clusterings produced by running a clustering algorithm with a range of parameters. This gives geometric structure to such sets of clustering…
We study solvency of insurers in a comprehensive model where various economic factors affect the capital developments of the companies. The main interest is in the impact of real growth to ruin probabilities. The volume of the business is allowed to increase or decrease. In the latter case, the study is focused on run-…
Oil markets profoundly influence world economies through determination of prices of energy and transports. Using novel methodology devised in frequency domain, we study the information transmission mechanisms in oil-based commodity markets. Taking crude oil as a supply-side benchmark and heating oil and gasoline as dem…
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…
Emulator speeds up landslide run-out modeling sensitivity analysis.