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.

169,181 papers · 148 categories

Trend · papers per month

1.2%2.3%3.5%4.6% · Nov 202119922001200920182026
48 results for Binary masking

New algorithm separates audio sources better using alpha-stable distributions.

problem Improving audio source separation using complex distributions.
method Estimating mixtures of alpha-stable distributions using characteristic function matching.
result Better separation performance than Gaussian-based methods.

AFS-BM improves model accuracy by dynamically selecting features.

problem Feature selection challenges in ML, especially scalability and adaptability.
method Joint optimization for feature selection and model training with binary masking.
result AFS-BM achieves significant improvements in model accuracy and computational efficiency.

A new network predicts object/non-object masks to improve crowd counting.

problem Counting objects in images or videos with varying density.
method Proposes a network with a branch for object/non-object mask prediction, integrating it into the density map estimation.
result Demonstrates superior performance compared to baseline methods on five public datasets.

MARS automatically selects tensor decomposition ranks, improving performance in neural network tasks.

problem Determining optimal decomposition ranks in tensor decompositions.
method MARS uses binary masks to learn optimal tensor structure during training via relaxed MAP estimation.
result MARS achieves better results than previous methods in various tasks.

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 ↗

A novel method for feature selection using a reparameterized logitNormal distribution.

problem Feature selection for reconstruction in high-dimensional data.
method Introducing a reparameterization of the logitNormal distribution to address differentiability and covariance issues.
result The method provides an effective exploration scheme and efficient feature selection for reconstruction.

MCLNN improves sound recognition by learning frequency bands.

problem Efficiently recognizing acoustic events from audio signals.
method MCLNN uses a binary mask to force sparseness in network weights, focusing on frequency bands.
result MCLNN achieves competitive performance in sound recognition compared to state-of-the-art methods.

A common strategy for sparse linear regression is to introduce regularization, which eliminates irrelevant features by letting the corresponding weights be zeros. However, regularization often shrinks the estimator for relevant features, which leads to incorrect feature selection. Motivated by the above-mentioned issue…

2015-09-03abs ↗pdf ↗

Quantized neural networks can improve robustness against adversarial attacks.

problem Adversarial attacks on neural networks with low-precision weights and activations.
method Proposed a third benefit of very low-precision neural networks: improved robustness against some adversarial attacks. Focused on weights and activations quantized to ±1, and conducted black-box and white-box experiments.
result Non-scaled binary neural networks can reduce the impact of iterative attacks, but do not artificially mask gradients.

This paper improves multichannel speech enhancement using complex ratio masking and channel-attention.

problem Limited performance of deep learning methods in multichannel speech enhancement.
method Introduces complex ratio masking and channel-attention mechanism inside a U-Net architecture.
result Demonstrates superior performance on the CHiME-3 dataset.

New neural network separates singing voices from music using cross entropy loss.

problem Separating singing voices from music accompaniment.
method Deep Convolutional Neural Network (CNN) trained with Ideal Binary Mask (IBM) and cross entropy loss.
result Proposed CNN outperforms existing systems in MIREX evaluations.

XTNet estimates complex cross-treatment effects in multi-category, multi-valued settings.

problem Challenges in estimating causal effects for multi-category, multi-valued treatments.
method Dynamic Neural Masking for capturing treatment interactions without restrictive assumptions.
result XTNet consistently outperforms state-of-the-art baselines in multi-category, multi-valued treatment effect estimation.

This research improves transparency in RNN predictions of ICU mortality risk.

problem Lack of transparency in RNNs' healthcare predictions.
method Introduced Learned Binary Masks (LBM) and KernelSHAP for identifying EMR variables' contributions to RNN risk of mortality predictions.
result Attribution matrices show each input feature's contribution to RNN predictions, facilitating analysis of the model and its predictions.

Post-processing improves WMH segmentation accuracy from randomly-initialized U-nets.

problem Improving WMH segmentation accuracy from randomly-initialized U-nets.
method Post-processing technique involving thresholding and averaging U-net outputs.
result Superior performance of the proposed post-processing method.

LatFormer improves geometric reasoning by incorporating lattice symmetry priors in attention mechanisms.

problem State-of-the-art models struggle with geometric reasoning tasks in the ARC and LARC datasets.
method Introduced LatFormer, a model that uses lattice symmetry priors in attention masks.
result LatFormer requires 2 orders of magnitude fewer data than standard attention mechanisms.

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.

FMix improves model performance by distorting learned functions without distorting data distribution.

problem Improving model robustness and generalization performance in mixed sample data augmentation.
method Proposes FMix, an MSDA using random binary masks generated from Fourier space.
result FMix outperforms MixUp and CutMix, achieving state-of-the-art results on CIFAR-10.

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.

Models predict probabilities of causation from limited data.

problem Estimating probabilities of causation requires unreliable or impractical experimental and observational data.
method Proposed Exact-MLP and Mask-MLP models trained on reliable subpopulations.
result Models achieve average MAEs of roughly 0.03, reducing MAE by 80%.

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.

BshapeNet improves object detection and instance segmentation using bounding shape masks.

problem Improving object detection and instance segmentation performance.
method Proposes bbox and bshape masks, and combines them with Faster R-CNN and Mask R-CNN frameworks.
result BshapeNet+ achieves highly competitive results with state of the art models, improving detection and instance segmentation.

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.

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.

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.

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.

Optimization-based pruning eliminates backpropagation for large language models.

problem Suboptimal pruning performance due to heuristic metrics.
method Optimization of Bernoulli distribution to learn pruning masks without backpropagation.
result Efficient pruning of large language models with improved performance.

Improved YOLOv5 model detects mask-wearing with enhanced accuracy.

problem Detecting mask-wearing in high traffic public places.
method Improved YOLOv5l with Multi-Head Attentional Self-Convolution, Swin Transformer Block, I-CBAM module, and enhanced feature fusion.
result 1.1% improvement in mAP(0.5) and 1.3% improvement in mAP(0.5:0.95) compared to YOLOv5l.

Simplified masked diffusion models improve discrete data generation.

problem Complex model formulations and unclear relationships hinder discrete data generative modeling.
method Developed a simple and general framework for masked diffusion models.
result Models trained on OpenWebText surpass prior diffusion language models and outperform autoregressive models.

Language models trained on chess board states outperform those on moves, even with causal masking.

problem Applying causal masking to spatial data for training unimodal language models.
method Trained bidirectional and causal self-attention models on both spatial (board-based) and sequential (move-based) chess data.
result Models trained on spatial board states achieve stronger playing strength than those trained on sequential data, even with causal masking.

Masking diffusion outperforms other discrete diffusion models by incorporating jump times into the model.

problem Improving the performance of discrete diffusion models.
method Conditioning on the jump schedule of discrete Markov processes.
result Schedule-conditioned discrete diffusion (SCUD) models outperform classical and masking diffusion models.