paper-with-me

Papers

Ada-Boundary: Accelerating the DNN Training via Adaptive Boundary Batch Selection

2019-05-01 · ICLR 2019 5 · Hwanjun Song, Sundong Kim, Minseok Kim, Jae-Gil Lee

Neural networks can converge faster with help from a smarter batch selection strategy. In this regard, we propose Ada-Boundary, a novel adaptive-batch selection algorithm that constructs an effective mini-batch according to the learning progress of the model.Our key idea is to present confusing samples what the true label is. Thus, the samples near the current decision boundary are considered as the most effective to expedite convergence. Taking advantage of our design, Ada-Boundary maintains its dominance in various degrees of training difficulty. We demonstrate the advantage of Ada-Boundary by extensive experiments using two convolutional neural networks for three benchmark data sets. The experiment results show that Ada-Boundary improves the training time by up to 31.7% compared with the state-of-the-art strategy and by up to 33.5% compared with the baseline strategy.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Exploring the Security Boundary of Data Reconstruction via Neuron Exclusivity Analysis

2020-10-26 · Xudong Pan, Mi Zhang, Yifan Yan, Jiaming Zhu 외

Among existing privacy attacks on the gradient of neural networks, \emph{data reconstruction attack}, which reverse engineers the training batch from the gradient, poses a severe threat on the private training data. Desp…

Face RecognitionReconstruction Attack

Seeing the End at Step Zero: Accelerating Diffusion MLLMs via MLP Sparsity-Aware Truncation

2026-07-16 · Qicheng Zhao, Qi Sun, Zheyu Yan arxiv

Diffusion Multimodal Large Language Models (DMLLMs) are highly effective for multimodal reasoning, yet their inference efficiency is significantly hindered by fixed-length generation constraints. Since the actual output …

Multimodal Reasoning

Sample-Efficiency in Multi-Batch Reinforcement Learning: The Need for Dimension-Dependent Adaptivity

2023-10-02 · Emmeran Johnson, Ciara Pike-Burke, Patrick Rebeschini

We theoretically explore the relationship between sample-efficiency and adaptivity in reinforcement learning. An algorithm is sample-efficient if it uses a number of queries $n$ to the environment that is polynomial in t…

reinforcement-learningReinforcement Learning

Adaptive Boundary Proposal Network for Arbitrary Shape Text Detection

2021-07-27 · ICCV 2021 10 · Shi-Xue Zhang, Xiaobin Zhu, Chun Yang, Hongfa Wang 외

Arbitrary shape text detection is a challenging task due to the high complexity and variety of scene texts. In this work, we propose a novel adaptive boundary proposal network for arbitrary shape text detection, which ca…

DecoderText Detection

Membership inference attack with relative decision boundary distance

2023-06-07 · Jiacheng Xu, Chengxiang Tan

Membership inference attack is one of the most popular privacy attacks in machine learning, which aims to predict whether a given sample was contained in the target model's training set. Label-only membership inference a…

Inference AttackMembership Inference Attack