paper-with-me

홈 › Papers

SpeedMachines: Anytime Structured Prediction

2013-12-02 · Alexander Grubb, Daniel Munoz, J. Andrew Bagnell, Martial Hebert

Structured prediction plays a central role in machine learning applications from computational biology to computer vision. These models require significantly more computation than unstructured models, and, in many applications, algorithms may need to make predictions within a computational budget or in an anytime fashion. In this work we propose an anytime technique for learning structured prediction that, at training time, incorporates both structural elements and feature computation trade-offs that affect test-time inference. We apply our technique to the challenging problem of scene understanding in computer vision and demonstrate efficient and anytime predictions that gradually improve towards state-of-the-art classification performance as the allotted time increases.

📄 PDF Abstract BibTeX arXiv:1312.0579

Code (0)

등록된 구현이 없습니다.

Tasks

General ClassificationPredictionScene UnderstandingStructured Prediction

Similar Papers 제목 키워드 기반

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

Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration

2019-02-14 · NeurIPS 2019 12 · Robert Kleinberg, Kevin Leyton-Brown, Brendan Lucier, Devon Graham

Algorithm configuration methods optimize the performance of a parameterized heuristic algorithm on a given distribution of problem instances. Recent work introduced an algorithm configuration procedure ("Structured Procr…

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

Anytime Neural Network: a Versatile Trade-off Between Computation and Accuracy

2018-01-01 · ICLR 2018 1 · Hanzhang Hu, Debadeepta Dey, Martial Hebert, J. Andrew Bagnell

We present an approach for anytime predictions in deep neural networks (DNNs). For each test sample, an anytime predictor produces a coarse result quickly, and then continues to refine it until the test-time computationa…

Efficient Feature Group Sequencing for Anytime Linear Prediction

2014-09-19 · Hanzhang Hu, Alexander Grubb, J. Andrew Bagnell, Martial Hebert

We consider \textit{anytime} linear prediction in the common machine learning setting, where features are in groups that have costs. We achieve anytime (or interruptible) predictions by sequencing the computation of feat…

Prediction