paper-with-me

Papers

Subset Sampling For Progressive Neural Network Learning

2020-02-17 · Dat Thanh Tran, Moncef Gabbouj, Alexandros Iosifidis

Progressive Neural Network Learning is a class of algorithms that incrementally construct the network's topology and optimize its parameters based on the training data. While this approach exempts the users from the manual task of designing and validating multiple network topologies, it often requires an enormous number of computations. In this paper, we propose to speed up this process by exploiting subsets of training data at each incremental training step. Three different sampling strategies for selecting the training samples according to different criteria are proposed and evaluated. We also propose to perform online hyperparameter selection during the network progression, which further reduces the overall training time. Experimental results in object, scene and face recognition problems demonstrate that the proposed approach speeds up the optimization procedure considerably while operating on par with the baseline approach exploiting the entire training set throughout the training process.

📄 PDF Abstract BibTeX arXiv:2002.07141

Code (1)

viebboy/SIPL 공식 구현 tf

Tasks

Face Recognition

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

Making the Nyström method highly accurate for low-rank approximations

2023-07-11 · Jianlin Xia

The Nystr\"om method is a convenient heuristic method to obtain low-rank approximations to kernel matrices in nearly linear complexity. Existing studies typically use the method to approximate positive semidefinite matri…

Performance-Complexity Tradeoffs in Greedy Weak Submodular Maximization with Random Sampling

2019-07-22 · Abolfazl Hashemi, Haris Vikalo, Gustavo de Veciana

Many problems in signal processing and machine learning can be formalized as weak submodular optimization tasks. For such problems, a simple greedy algorithm (\textsc{Greedy}) is guaranteed to find a solution achieving t…

Dimensionality Reductionfeature selectionObject Tracking

Progressive Boosting for Class Imbalance

2017-06-05 · Roghayeh Soleymani, Eric Granger, Giorgio Fumera

Pattern recognition applications often suffer from skewed data distributions between classes, which may vary during operations w.r.t. the design data. Two-class classification systems designed using skewed data tend to r…

Ensemble Learning

Bayesian Optimization of Functions over Node Subsets in Graphs

2024-05-24 · Huidong Liang, Xingchen Wan, Xiaowen Dong

We address the problem of optimizing over functions defined on node subsets in a graph. The optimization of such functions is often a non-trivial task given their combinatorial, black-box and expensive-to-evaluate nature…

Bayesian OptimizationCombinatorial Optimization

Representing pictures with emotions

2018-12-06 · António Filipe Fonseca

Modern research in content-based image retrieval systems (CIBR) has become progressively more focused on the richness of human semantics. Several approaches may be used to reduced the 'semantic gap' between the high-leve…

Content-Based Image RetrievalImage RetrievalRetrieval