Research
On-device research index

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.

168,695 papers · 148 categories

Trend · papers per month

130260390520 · Jun 202019922001200920172026
48 results for masked prediction

The recently proposed mask-predict decoding algorithm has narrowed the performance gap between semi-autoregressive machine translation models and the traditional left-to-right approach. We introduce a new training method for conditional masked language models, SMART, which mimics the semi-autoregressive behavior of mas…

2020-01-23abs ↗pdf ↗

Proposes a proportional masking strategy for better tabular data imputation.

problem Heterogeneity of tabular data disrupts uniform random masking in MAEs.
method Computes missingness statistics, generates proportional masks, uses MLP token mixing.
result Proportional masking preserves missingness distribution, improves imputation performance.

Adapts conformal prediction for missing data, ensuring valid coverage.

problem Uncertainty quantification with missing covariates.
method Proposes a reweighted conformal prediction procedure for handling missing values.
result Guaranteed Marginal Coverage and Mask-Conditional Validity for general missing data mechanisms.

Most machine translation systems generate text autoregressively from left to right. We, instead, use a masked language modeling objective to train a model to predict any subset of the target words, conditioned on both the input text and a partially masked target translation. This approach allows for efficient iterative…

2019-04-19abs ↗pdf ↗

Study improves healthcare time series imputation by considering structured missingness.

problem Structured missingness in clinical data impacts time series imputation models.
method Analysis of different masking strategies on imputation methods using PhysioNet Challenge 2012 dataset.
result Masking choices significantly affect imputation accuracy and clinical prediction.

A new approach to protein language models combines latent space prediction with masked language modeling.

problem Improving protein language models by predicting amino acid identities at masked positions.
method A variant of masked language modeling that predicts latent targets only at masked positions, retaining the MLM cross-entropy.
result The new approach outperforms pure masked language modeling on 11 out of 16 downstream tasks.

Neural network interpretability is a vital component for applications across a wide variety of domains. In such cases it is often useful to analyze a network which has already been trained for its specific purpose. In this work, we develop a method to produce explanation masks for pre-trained networks. The mask localiz…

2019-11-15abs ↗pdf ↗

Crowd counting problem aims to count the number of objects within an image or a frame in the videos and is usually solved by estimating the density map generated from the object location annotations. The values in the density map, by nature, take two possible states: zero indicating no object around, a non-zero value i…

2018-12-18abs ↗pdf ↗

This paper connects masked pre-training to Bayesian model selection.

problem Understanding the success of masked pre-training and its generalization.
method The paper shows masked pre-training corresponds to maximizing the marginal likelihood.
result Masked pre-training with a suitable scoring function maximizes the marginal likelihood.

New analysis reveals masked self-supervised learning's effectiveness in extracting data structure.

problem Analyzing masked self-supervised learning in high-dimensional data.
method Developed precise high-dimensional analysis of masked modeling objectives.
result Identified phase transitions and structured regimes for masked self-supervised learning.

Differentiable Masking reveals how neural models make decisions across layers.

problem Intractable and expensive approximate search for input relevance in deep models.
method Differentiable Masking learns to mask inputs while maintaining differentiability.
result Reveals how decisions are formed across network layers in BERT models.

Unified framework for ICL in causal and masked models.

problem Understanding ICL in masked language models and comparing it to causal models.
method Developed a statistical learning framework representing context by empirical measure and predicting using context and query.
result Upper bounds for masked and autoregressive objectives under Wasserstein-type regularity conditions.

Unified model combines feature and label propagation for semi-supervised classification.

problem Combining feature and label propagation for effective semi-supervised classification.
method Unified Message Passing Model (UniMP) using Graph Transformer and masked label prediction.
result Obtains new state-of-the-art results in Open Graph Benchmark (OGB).

Develops a multilevel Monte Carlo framework with dropout for efficient uncertainty quantification.

problem Efficiently quantify uncertainty in complex models using dropout.
method Integrates multilevel Monte Carlo with Monte Carlo dropout, creating coupled estimators to reduce variance.
result Demonstrates significant variance reduction and efficiency gains over single-level Monte Carlo dropout.

The paper investigates the effects of invalid action masking in policy gradient algorithms.

problem Invalid actions in policy gradient algorithms can lead to suboptimal performance.
method The paper provides theoretical justification and empirical demonstrations of the importance of invalid action masking.
result Invalid action masking is crucial as the number of invalid actions increases.

New criteria improve imputation model selection using MOO.

problem Selecting the best imputation model using prediction accuracy metrics.
method Introduced three modified MOO criteria based on rank transformation, energy distance, and likelihood principle.
result Demonstrated how MOO is related to missing-at-random assumption and derived statistical and computational learning theories.

We consider the effect of structure-agnostic and structure-dependent masking schemes when training a universal marginaliser (arXiv:1711.00695) in order to learn conditional distributions of the form P(xixb)P(x_i |\mathbf x_{\mathbf b}), where xix_i is a given random variable and xb\mathbf x_{\mathbf b} is some arbitrary sub…

2020-01-16abs ↗pdf ↗

PMI-Masking improves MLM pretraining by masking correlated spans efficiently.

problem Uniform token masking leads to inefficient and suboptimal performance in MLMs.
method PMI-Masking uses Pointwise Mutual Information to mask n-grams with high collocation.
result PMI-Masking reaches half the training time and improves performance.

A technique scales symbolic methods with gradients for neural model explanation.

problem Limited scalability of symbolic methods for large neural networks.
method Combines gradient-based methods with symbolic techniques using Integrated Gradients to focus on a subset of neurons.
result Produces sparser and higher saliency regions compared to gradient-based methods alone.

We introduce a pretraining technique called Selfie, which stands for SELFie supervised Image Embedding. Selfie generalizes the concept of masked language modeling of BERT (Devlin et al., 2019) to continuous data, such as images, by making use of the Contrastive Predictive Coding loss (Oord et al., 2018). Given masked-o…

2019-06-07abs ↗pdf ↗

Motivated by the fact that most of the information relevant to the prediction of target tokens is drawn from the source sentence S=s1,,sSS=s_1, \ldots, s_S, we propose truncating the target-side window used for computing self-attention by making an NN-gram assumption. Experiments on WMT EnDe and EnFr data sets show that the…

2020-01-14abs ↗pdf ↗

ST-MTM models complex time series by decomposing and masking seasonal and trend components.

problem Forecasting complex time series with intricate temporal variations.
method Seasonal-Trend Decomposition with Masking and Contrastive Learning.
result ST-MTM achieves superior forecasting performance compared to existing methods.

Algorithm generates adaptive confidence sets for instance segmentation with guaranteed coverage.

problem Uncalibrated predictions and lack of uncertainty quantification in instance segmentation models.
method Conformal prediction algorithm to generate adaptive confidence sets with provable guarantees.
result Empirically, prediction sets vary in size based on query difficulty and attain target coverage, outperforming baselines.

PSI models and infers feature attributions efficiently and accurately.

problem Modeling and inferring feature attributions in flexible predictive models.
method Probabilistic Shapley inference (PSI) framework using latent random variables and a masking-based neural network architecture.
result PSI learns feature attribution distributions centered at Shapley values, revealing meaningful uncertainty.

Proposes a new approach to time series representation learning by embedding patches independently.

problem Capturing dependencies between time series patches is not optimal for representation learning.
method 1) Patch reconstruction task, 2) Patch-wise MLP, 3) Complementary contrastive learning.
result Improves time series forecasting and classification performance compared to state-of-the-art models.

A framework to explain decoder-only sequence classification models using intermediate predictions.

problem Explaining predictions of decoder-only sequence classification models.
method Progressive Inference framework with Single Pass-Progressive Inference and Multi Pass-Progressive Inference methods.
result Significantly better attributions compared to prior work on text classification tasks.

Improved sentiment analysis in Korean finance using masked PLMs.

problem Fine-grained sentiment analysis in non-English finance literature is lacking due to limited annotated data.
method Developed KorFinASC dataset and applied TGT-Masking to PLMs to remove non-stationary knowledge.
result Improved classification accuracy by 22.63% on KorFinASC.

A new method uses conformal prediction to create reliable confidence masks for image super-resolution.

problem Uncertainty quantification in image super-resolution using generative models.
method Conformal prediction techniques applied to a confidence mask for reliable uncertainty communication.
result Strong theoretical guarantees and empirical solid performance in image super-resolution.

BetaExplainer improves GNN interpretability by masking unimportant edges.

problem Interpreting GNNs' predictions is difficult due to black-box behavior and lack of uncertainty quantification.
method BetaExplainer uses a sparsity-inducing prior to mask unimportant edges during training.
result BetaExplainer provides uncertainty in edge importance and improves predictive accuracy on challenging datasets.

Paper proposes a new sparse Bayesian neural network for simpler, more efficient DNNs.

problem Complex and large DNN architectures require simplification for better performance and efficiency.
method Masked Bayesian Neural Networks (BNN) with nodewise sparsity and optimal posterior distributions.
result The proposed BNN yields well-condensed DNN architectures with similar accuracy and uncertainty quantification to large DNNs.

Optimizes pruning masks for neural networks using probabilistic fine-tuning and PAC-Bayes bounds.

problem Improving neural network performance through adaptive pruning of weights.
method Optimizes stochastic pruning masks by minimizing expected loss, considering data-adaptive regularization and feature alignment.
result Probabilistic fine-tuning leads to improved test error over baseline methods in neural networks.

We consider the problem of selecting an optimal mask for an image manifold, i.e., choosing a subset of the pixels of the image that preserves the manifold's geometric structure present in the original data. Such masking implements a form of compressive sensing through emerging imaging sensor platforms for which the pow…

2016-06-15abs ↗pdf ↗

PatchGuard defends against localized adversarial patches with provable robustness.

problem Localized adversarial patches induce misclassification in machine learning models.
method PatchGuard uses CNNs with small receptive fields and robust masking to detect and mask corrupted features.
result PatchGuard achieves state-of-the-art provable robust accuracy and clean accuracy.

The paper offers generalization bounds for Transformers that ignore sequence length.

problem Developing generalization bounds for Transformers that are independent of sequence length.
method Covering number approach to upper bound Rademacher complexity of bounded linear transformations.
result Theoretical bounds for Transformer generalization are independent of sequence length.

New lens on self-supervised learning: parameter identifiability.

problem Identifying good features for downstream tasks in self-supervised learning.
method Consider data from a parametric probabilistic model, train a predictor, and ask if ground truth parameters can be read off the optimal predictor.
result Some prediction tasks yield identifiability, others do not, revealing a rich landscape.