English
Related papers

Related papers: Selective sampling for accelerating training of de…

200 papers

Marginalized importance sampling (MIS), which measures the density ratio between the state-action occupancy of a target policy and that of a sampling distribution, is a promising approach for off-policy evaluation. However, current…

Machine Learning · Computer Science 2023-11-15 Scott Fujimoto , David Meger , Doina Precup

Stochastic gradient decent~(SGD) and its variants, including some accelerated variants, have become popular for training in machine learning. However, in all existing SGD and its variants, the sample size in each iteration~(epoch) of…

Machine Learning · Statistics 2019-09-18 Shen-Yi Zhao , Hao Gao , Wu-Jun Li

The training process of neural networks is known to be time-consuming, and having a deep architecture only aggravates the issue. This process consists mostly of matrix operations, among which matrix multiplication is the bottleneck. Several…

Machine Learning · Computer Science 2025-06-17 Sana Ebrahimi , Rishi Advani , Abolfazl Asudeh

Autoregressive models (ARMs) currently hold state-of-the-art performance in likelihood-based modeling of image and audio data. Generally, neural network based ARMs are designed to allow fast inference, but sampling from these models is…

Machine Learning · Computer Science 2020-07-09 Auke Wiggers , Emiel Hoogeboom

Midline shift (MLS) is a well-established factor used for outcome prediction in traumatic brain injury, stroke and brain tumors. The importance of automatic estimation of MLS was recently highlighted by ACR Data Science Institute. In this…

There has long been debates on how we could interpret neural networks and understand the decisions our models make. Specifically, why deep neural networks tend to be error-prone when dealing with samples that output low softmax scores. We…

Computer Vision and Pattern Recognition · Computer Science 2018-12-04 Simiao Zuo , Jialin Wu

Sampling methods (e.g., node-wise, layer-wise, or subgraph) has become an indispensable strategy to speed up training large-scale Graph Neural Networks (GNNs). However, existing sampling methods are mostly based on the graph structural…

Machine Learning · Computer Science 2021-09-07 Weilin Cong , Rana Forsati , Mahmut Kandemir , Mehrdad Mahdavi

Large-scale supervised classification algorithms, especially those based on deep convolutional neural networks (DCNNs), require vast amounts of training data to achieve state-of-the-art performance. Decreasing this data requirement would…

Computer Vision and Pattern Recognition · Computer Science 2016-06-15 Maya Kabkab , Azadeh Alavi , Rama Chellappa

We present a formulation of deep learning that aims at producing a large margin classifier. The notion of margin, minimum distance to a decision boundary, has served as the foundation of several theoretically profound and empirically…

Machine Learning · Statistics 2018-12-05 Gamaleldin F. Elsayed , Dilip Krishnan , Hossein Mobahi , Kevin Regan , Samy Bengio

Unstructured pruning reduces the memory footprint in deep neural networks (DNNs). Recently, researchers proposed different types of structural pruning intending to reduce also the computation complexity. In this work, we first suggest a new…

Artificial Intelligence · Computer Science 2021-10-22 Itay Hubara , Brian Chmiel , Moshe Island , Ron Banner , Seffi Naor , Daniel Soudry

Several researchers have proposed minimisation of maximum mean discrepancy (MMD) as a method to quantise probability measures, i.e., to approximate a target distribution by a representative point set. We consider sequential algorithms that…

Machine Learning · Statistics 2021-02-15 Onur Teymur , Jackson Gorham , Marina Riabiz , Chris. J. Oates

We present a new active sampling method we call min-margin which trains multiple learners on bootstrap samples and then chooses the examples to label based on the candidates' minimum margin amongst the bootstrapped models. This extends…

Machine Learning · Computer Science 2019-06-04 Heinrich Jiang , Maya Gupta

We propose a stochastic optimization method for minimizing loss functions, expressed as an expected value, that adaptively controls the batch size used in the computation of gradient approximations and the step size used to move along such…

Machine Learning · Computer Science 2020-03-04 Achraf Bahamou , Donald Goldfarb

The problem of relevant and diverse subset selection has a wide range of applications, including recommender systems and retrieval-augmented generation (RAG). For example, in recommender systems, one is interested in selecting relevant…

Machine Learning · Computer Science 2026-03-10 Vu Nguyen , Andrey Kan

For many machine learning problems, data is abundant and it may be prohibitive to make multiple passes through the full training set. In this context, we investigate strategies for dynamically increasing the effective sample size, when…

Machine Learning · Computer Science 2016-10-10 Hadi Daneshmand , Aurelien Lucchi , Thomas Hofmann

Few-shot learning aims to train a classifier that can generalize well when just a small number of labeled examples per class are given. We introduce a transductive maximum margin classifier for few-shot learning (FS-TMMC). The basic idea of…

Computer Vision and Pattern Recognition · Computer Science 2021-10-29 Fei Pan , Chunlei Xu , Jie Guo , Yanwen Guo

In scanning microscopy based imaging techniques, there is a need to develop novel data acquisition schemes that can reduce the time for data acquisition and minimize sample exposure to the probing radiation. Sparse sampling schemes are…

Signal Processing · Electrical Eng. & Systems 2018-03-09 Yan Zhang , G. M. Dilshan Godaliyadda , Nicola Ferrier , Emine B. Gulsoy , Charles A. Bouman , Charudatta Phatak

To address the modality imbalance caused by data heterogeneity, existing multi-modal learning (MML) approaches primarily focus on balancing this difference from the perspective of optimization objectives. However, almost all existing…

Machine Learning · Computer Science 2025-01-06 Zhi-Hao Guan

Time-dependent partial differential equations (PDEs) often develop sharp fronts, localized peaks, and other moving structures that occupy only a small portion of the space--time domain but dominate the approximation error. This makes fixed…

Numerical Analysis · Mathematics 2026-05-27 Beining Xu , Bocheng Zhang , Haijun Yu , Zhao Zhang , Jiayu Zhai

We introduce a novel framework for efficient sampling from complex, unnormalised target distributions by exploiting multiscale dynamics. Traditional score-based sampling methods either rely on learned approximations of the score function or…

Computation · Statistics 2025-11-04 Paula Cordero-Encinar , Andrew B. Duncan , Sebastian Reich , O. Deniz Akyildiz