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.
Optimizes sample weights for representative data averages.
This paper reviews and introduces measures for data representativity in AI systems.
The paper tackles sampling biases by ensuring minority groups are adequately represented in training data.
iRDM selects unlabeled samples for regression without labels, improving model accuracy.
MOSAIC selects few informative exemplars from high-dimensional data with non-linear structures.
This paper proposes new methods for ALR that consider informativeness, representativeness, and diversity.
A new deep learning framework selects representative samples for unsupervised learning.
Many problems in machine learning can be expressed by means of a graph with nodes representing training samples and edges representing the relationship between samples in terms of similarity, temporal proximity, or label information. Graphs can in turn be represented by matrices. A special example is the Laplacian matr…
Overfitting in deep learning has been the focus of a number of recent works, yet its exact impact on the behavior of neural networks is not well understood. This study analyzes overfitting by examining how the distribution of logits alters in relation to how much the model overfits. Specifically, we find that when trai…
New method identifies cluster representatives with minimal pulls.
FWC creates fair synthetic samples for machine learning tasks.
The age of big data has produced data sets that are computationally expensive to analyze and store. Algorithmic leveraging proposes that we sample observations from the original data set to generate a representative data set and then perform analysis on the representative data set. In this paper, we present efficient a…
Self-attention prefers sparse functions of input sequences, reducing sample complexity.
The model is aimed to discriminate the 'good' and the 'bad' companies in Russian corporate sector based on their financial statements data based on Russian Accounting Standards. The data sample consists of 126 Russian public companies- issuers of Ruble bonds which represent about 36% of total number of corporate bonds …
We formulate the problem of sampling and recovering clustered graph signal as a multi-armed bandit (MAB) problem. This formulation lends naturally to learning sampling strategies using the well-known gradient MAB algorithm. In particular, the sampling strategy is represented as a probability distribution over the indiv…
In this thesis we present the novel semi-supervised network-based algorithm P-Net, which is able to rank and classify patients with respect to a specific phenotype or clinical outcome under study. The peculiar and innovative characteristic of this method is that it builds a network of samples/patients, where the nodes …
Simplifies large action space bandits by selecting representative actions.
New framework formalizes RLHF trilemma: improving safety, fairness, and robustness is computationally infeasible.
Importance sampling is one of the most widely used variance reduction strategies in Monte Carlo rendering. In this paper, we propose a novel importance sampling technique that uses a neural network to learn how to sample from a desired density represented by a set of samples. Our approach considers an existing Monte Ca…
New method improves experimental design under model misspecification.
Approximate linear programming (ALP) represents one of the major algorithmic families to solve large-scale Markov decision processes (MDP). In this work, we study a primal-dual formulation of the ALP, and develop a scalable, model-free algorithm called bilinear learning for reinforcement learning when a sampling or…
How can we find a general way to choose the most suitable samples for training a classifier? Even with very limited prior information? Active learning, which can be regarded as an iterative optimization procedure, plays a key role to construct a refined training set to improve the classification performance in a variet…
Hypermodels improve exploration efficiency and accuracy.
Ensemble sampling approximates Thompson sampling for complex models.
With a growing interest in using non-representative samples to train prediction models for numerous outcomes it is necessary to account for the sampling design that gives rise to the data in order to assess the generalized predictive utility of a proposed prediction rule. After learning a prediction rule based on a non…
Big data sets must be carefully partitioned into statistically similar data subsets that can be used as representative samples for big data analysis tasks. In this paper, we propose the random sample partition (RSP) data model to represent a big data set as a set of non-overlapping data subsets, called RSP data blocks,…
The Epps effect helps distinguish between continuous and discrete financial tick data.
This work proposes efficient classical training protocols for IQP circuits to train quantum generative models.
Researchers prove NP-hardness of learning parameter-bounded Bayes nets.
New method efficiently samples Gaussian process posteriors without cubic scaling.
A new method uses sinusoidal functions to represent timestamps as dense vectors for improving irregularly sampled time series learning.
Stochastic optimization techniques are standard in variational inference algorithms. These methods estimate gradients by approximating expectations with independent Monte Carlo samples. In this paper, we explore a technique that uses correlated, but more representative , samples to reduce estimator variance. Specifical…
Sum-Product Networks (SPNs) can be regarded as a form of deep graphical models that compactly represent deeply factored and mixed distributions. An SPN is a rooted directed acyclic graph (DAG) consisting of a set of leaves (corresponding to base distributions), a set of sum nodes (which represent mixtures of their chil…
Recent years have witnessed the emergence of 3D medical imaging techniques with the development of 3D sensors and technology. Due to the presence of noise in image acquisition, registration researchers focused on an alternative way to represent medical images. An alternative way to analyze medical imaging is by underst…
We present an application of deep generative models in the context of partial-differential equation (PDE) constrained inverse problems. We combine a generative adversarial network (GAN) representing an a priori model that creates subsurface geological structures and their petrophysical properties, with the numerical so…
Outlier detection is a fundamental task in data mining and has many applications including detecting errors in databases. While there has been extensive prior work on methods for outlier detection, modern datasets often have sizes that are beyond the ability of commonly used methods to process the data within a reasona…
Active learning is a machine learning approach for reducing the data labeling effort. Given a pool of unlabeled samples, it tries to select the most useful ones to label so that a model built from them can achieve the best possible performance. This paper focuses on pool-based sequential active learning for regression …
Develops a measure for checking cluster quality using multinomial distribution.
Thompson sampling used for linear bandits with normal-gamma priors.
Extracts representative scenarios from large data panels.
Quantum algorithm samples from SDEs using DQCs and quantile mechanics.
LIIT uses large deviations to train neural networks faster.
A non-parametric method for ranking stock indices according to their mutual causal influences is presented. Under the assumption that indices reflect the underlying economy of a country, such a ranking indicates which countries exert the most economic influence in an examined subset of the global economy. The proposed …
Clinical measurements collected over time are naturally represented as multivariate time series (MTS), which often contain missing data. An autoencoder can learn low dimensional vectorial representations of MTS that preserve important data characteristics, but cannot deal explicitly with missing data. In this work, we …
Locally learned synaptic failure enables complete Bayesian inference.
Deep convolutional neural networks can be highly vulnerable to small perturbations of their inputs, potentially a major issue or limitation on system robustness when using deep networks as classifiers. In this paper we propose a low-cost method to explore marginal sample data near trained classifier decision boundaries…
The paper addresses sampling bias in risk-based active learning.
Training energy-based probabilistic models is confronted with apparently intractable sums, whose Monte Carlo estimation requires sampling from the estimated probability distribution in the inner loop of training. This can be approximately achieved by Markov chain Monte Carlo methods, but may still face a formidable obs…