paper-with-me

홈 › Papers

Improving Anytime Prediction with Parallel Cascaded Networks and a Temporal-Difference Loss

2021-02-19 · NeurIPS 2021 12 · Michael L. Iuzzolino, Michael C. Mozer, Samy Bengio

Although deep feedforward neural networks share some characteristics with the primate visual system, a key distinction is their dynamics. Deep nets typically operate in serial stages wherein each layer completes its computation before processing begins in subsequent layers. In contrast, biological systems have cascaded dynamics: information propagates from neurons at all layers in parallel but transmission occurs gradually over time, leading to speed-accuracy trade offs even in feedforward architectures. We explore the consequences of biologically inspired parallel hardware by constructing cascaded ResNets in which each residual block has propagation delays but all blocks update in parallel in a stateful manner. Because information transmitted through skip connections avoids delays, the functional depth of the architecture increases over time, yielding anytime predictions that improve with internal-processing time. We introduce a temporal-difference training loss that achieves a strictly superior speed-accuracy profile over standard losses and enables the cascaded architecture to outperform state-of-the-art anytime-prediction methods. The cascaded architecture has intriguing properties, including: it classifies typical instances more rapidly than atypical instances; it is more robust to both persistent and transient noise than is a conventional ResNet; and its time-varying output trace provides a signal that can be exploited to improve information processing and inference.

📄 PDF Abstract BibTeX arXiv:2102.09808

Code (1)

michael-iuzzolino/CascadedNets 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

Average Pooling 설명 없음
Residual Block Residual Blocks are skip-connection blocks that learn residual functions with reference to the layer inputs, instead of learning unreferenced functions. They were introduced…
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Kaiming Initialization 설명 없음
ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
Residual Connection 설명 없음
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…

Similar Papers 제목 키워드 기반

A-ePA*SE: Anytime Edge-Based Parallel A* for Slow Evaluations

2023-05-08 · Hanlan Yang, Shohin Mukherjee, Maxim Likhachev

Anytime search algorithms are useful for planning problems where a solution is desired under a limited time budget. Anytime algorithms first aim to provide a feasible solution quickly and then attempt to improve it until…

Best-First Heuristic Search for Multicore Machines

2014-01-16 · Ethan Burns, Sofia Lemons, Wheeler Ruml, Rong Zhou

To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-first search in a shared-memory setting. We…

Heuristic Search

You Only Look Once at Anytime (AnytimeYOLO): Analysis and Optimization of Early-Exits for Object-Detection

2025-03-21 · Daniel Kuhse, Harun Teper, Sebastian Buschjäger, Chien-Yao Wang 외

We introduce AnytimeYOLO, a family of variants of the YOLO architecture that enables anytime object detection. Our AnytimeYOLO networks allow for interruptible inference, i.e., they provide a prediction at any point in t…

object-detectionObject Detection

Anytime Dense Prediction with Confidence Adaptivity

2021-04-01 · ICLR 2022 4 · Zhuang Liu, Zhiqiu Xu, Hung-Ju Wang, Trevor Darrell 외

Anytime inference requires a model to make a progression of predictions which might be halted at any time. Prior research on anytime visual recognition has mostly focused on image classification. We propose the first uni…

image-classificationImage ClassificationPose EstimationPrediction+1

Pseudo-Label Enhanced Cascaded Framework: 2nd Technical Report for LSVOS 2025 VOS Track

2025-09-18 · An Yan, Leilei Cao, Feng Lu, Ran Hong 외 arxiv

Complex Video Object Segmentation (VOS) presents significant challenges in accurately segmenting objects across frames, especially in the presence of small and similar targets, frequent occlusions, rapid motion, and comp…

Video Object SegmentationVideo Segmentation