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.
A new protocol evaluates small machine learning improvements conservatively.
Eluder dimension and information gain are equivalent for reproducing kernel Hilbert spaces.
Improved tabular models learn better from real-world data.
Weakly supervised data are widespread and have attracted much attention. However, since label quality is often difficult to guarantee, sometimes the use of weakly supervised data will lead to unsatisfactory performance, i.e., performance degradation or poor performance gains. Moreover, it is usually not feasible to man…
Framework for few-shot relation classification with minimal training data.
We solve exactly a simple model of trend following strategy, and obtain the analytical shape of the profit per trade distribution. This distribution is non trivial and has an option like, asymmetric structure. The degree of asymmetry depends continuously on the parameters of the strategy and on the volatility of the tr…
Generative AI boosts productivity and improves customer service quality.
FedFaiREE addresses fairness in decentralized learning with small samples.
Optimizes variance reduction in Heston model using large and moderate deviations.
Active learning is a powerful approach to analyzing data effectively. We show that the feasibility of active learning depends crucially on the choice of measure with respect to which the query is being optimized. The standard information gain, for example, does not permit an accurate evaluation with a small committee, …
Geodesic spheres in certain symmetric spaces are quantitatively stable under small perturbations.
The scalability of submodular optimization methods is critical for their usability in practice. In this paper, we study the reducibility of submodular functions, a property that enables us to reduce the solution space of submodular optimization problems without performance loss. We introduce the concept of reducibility…
Study makes code models robust to small changes that keep functionality.
Physics-enhanced NNs improve predictive accuracy in small data scenarios.
Paper explores understanding of neural source code embeddings.
Data augmentation is rapidly gaining attention in machine learning. Synthetic data can be generated by simple transformations or through the data distribution. In the latter case, the main challenge is to estimate the label associated to new synthetic patterns. This paper studies the effect of generating synthetic data…
A model of open economics composed of producers and speculators is investigated by numerical simulations. The capital flows from the environment to the producers and from them to the speculators. The price fluctuations are suppressed by the speculators. When the aggressivity of the speculators grows, there is a transit…
Mimetic initialization improves Transformer training on small datasets.
In the Minority, Majority and Dollar Games (MG, MAJG, $G), synthetic agents compete for rewards, at each time-step acting in accord with the previously best-performing of their limited sets of strategies. Different components and/or aspects of real-world financial markets are modelled by these games. In the MG, agents …
Develops methods to estimate gradient of EIG for Bayesian Experimental Design.
We present an extension of the Johansen-Ledoit-Sornette (JLS) model to include an additional pricing factor called the "Zipf factor", which describes the diversification risk of the stock market portfolio. Keeping all the dynamical characteristics of a bubble described in the JLS model, the new model provides additiona…
In standard graph clustering/community detection, one is interested in partitioning the graph into more densely connected subsets of nodes. In contrast, the "search" problem of this paper aims to only find the nodes in a "single" such community, the target, out of the many communities that may exist. To do so , we are …
The paper analyzes neural network dynamics after weights escape the origin.
Passive investing can incur hidden costs due to market timing inefficiencies.
Delayed rejection HMC improves sampling efficiency for multiscale distributions.
We address the efficiency issue for the construction of a deep graph neural network (GNN). The approach exploits the idea of representing each input graph as a fixed point of a dynamical system (implemented through a recurrent neural network), and leverages a deep architectural organization of the recurrent units. Effi…
Introduces relative information gain for improving Gaussian process regression rates.
The paper introduces a method to improve adversarial robustness in neural networks using randomized perturbations.
The application of deep recurrent networks to audio transcription has led to impressive gains in automatic speech recognition (ASR) systems. Many have demonstrated that small adversarial perturbations can fool deep neural networks into incorrectly predicting a specified target with high confidence. Current work on fool…
Deep learning has gained great popularity due to its widespread success on many inference problems. We consider the application of deep learning to the sparse linear inverse problem encountered in compressive sensing, where one seeks to recover a sparse signal from a small number of noisy linear measurements. In this p…
Decision trees algorithms use a gain function to select the best split during the tree's induction. This function is crucial to obtain trees with high predictive accuracy. Some gain functions can suffer from a bias when it compares splits of different arities. Quinlan proposed a gain ratio in C4.5's information gain fu…
Efficient EP algorithm improves smoothing distribution inference in financial models.
Building on similarities between earthquakes and extreme financial events, we use a self-organized criticality-generating model to study herding and avalanche dynamics in financial markets. We consider a community of interacting investors, distributed on a small-world network, who bet on the bullish (increasing) or bea…
Optimizes K inner simulations for least-square Monte Carlo to reduce computational cost.
Introduces q-paths for generalizing geometric annealing paths in machine learning.
TempBalance boosts model performance with low data.
Neural networks have many successful applications, while much less theoretical understanding has been gained. Towards bridging this gap, we study the problem of learning a two-layer overparameterized ReLU neural network for multi-class classification via stochastic gradient descent (SGD) from random initialization. In …
We study a an optimal high frequency trading problem within a market microstructure model designed to be a good compromise between accuracy and tractability. The stock price is driven by a Markov Renewal Process (MRP), while market orders arrive in the limit order book via a point process correlated with the stock pric…
Proposes a VAE for HDLSS data augmentation.
A good classification method should yield more accurate results than simple heuristics. But there are classification problems, especially high-dimensional ones like the ones based on image/video data, for which simple heuristics can work quite accurately; the structure of the data in such problems is easy to uncover wi…
Improved neural quantization reduces accuracy loss to less than 1% with 4-bit weights.
This paper proposes a method to gain extra supervision via multi-task learning for multi-modal video question answering. Multi-modal video question answering is an important task that aims at the joint understanding of vision and language. However, establishing large scale dataset for multi-modal video question answeri…
TAnoGan detects anomalies in time series data using GANs.
A key component of most neural network architectures is the use of normalization layers, such as Batch Normalization. Despite its common use and large utility in optimizing deep architectures, it has been challenging both to generically improve upon Batch Normalization and to understand the circumstances that lend them…
One obstacle that so far prevents the introduction of machine learning models primarily in critical areas is the lack of explainability. In this work, a practicable approach of gaining explainability of deep artificial neural networks (NN) using an interpretable surrogate model based on decision trees is presented. Sim…
Deep networks and forests perform differently with small samples.
The gain-loss ratio is known to enjoy very good properties from a normative point of view. As a confirmation, we show that the best market gain-loss ratio in the presence of a random endowment is an acceptability index and we provide its dual representation for general probability spaces. However, the gain-loss ratio w…
Efficient RL method uses SSL for small labeled data in health outcomes.