Chanakya: Learning Runtime Decisions for Adaptive Real-Time Perception

• URL: http://arxiv.org/abs/2106.05665v3
• Date: Fri, 10 Nov 2023 18:36:29 GMT
• Title: Chanakya: Learning Runtime Decisions for Adaptive Real-Time Perception
• Abstract summary: Chanakya is a learned approximate execution framework that automatically learns decisions induced by tradeoffs. It balances accuracy and latency implicitly, without approximating either objectives. It outperforms state-of-the-art static and dynamic execution policies on public datasets.
• Score: 4.201396612455545
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Real-time perception requires planned resource utilization. Computational planning in real-time perception is governed by two considerations -- accuracy and latency. There exist run-time decisions (e.g. choice of input resolution) that induce tradeoffs affecting performance on a given hardware, arising from intrinsic (content, e.g. scene clutter) and extrinsic (system, e.g. resource contention) characteristics. Earlier runtime execution frameworks employed rule-based decision algorithms and operated with a fixed algorithm latency budget to balance these concerns, which is sub-optimal and inflexible. We propose Chanakya, a learned approximate execution framework that naturally derives from the streaming perception paradigm, to automatically learn decisions induced by these tradeoffs instead. Chanakya is trained via novel rewards balancing accuracy and latency implicitly, without approximating either objectives. Chanakya simultaneously considers intrinsic and extrinsic context, and predicts decisions in a flexible manner. Chanakya, designed with low overhead in mind, outperforms state-of-the-art static and dynamic execution policies on public datasets on both server GPUs and edge devices.

Related papers

• Dual Process Motion Planning [53.570848178455776]
  We introduce a dual-process architecture that combines the strengths of robust reasoning and learning.<n>Our framework integrates state-of-the-art symbolic solvers as a System-2'' component with experience-driven System-1'' modules.
  arXiv  Detail & Related papers  (2026-09-01T13:52:12Z)
• Cloud Is Closer Than It Appears: Revisiting the Tradeoffs of Distributed Real-Time Inference [3.9986079633630975]
  Deep neural networks (DNNs) in cyber-physical systems (CPS) enhance perception fidelity, but impose substantial computational demands on execution platforms.<n>Traditional distributed CPS architectures favor on-device inference to avoid network variability and contention-induced delays on remote platforms.<n>In this work, we revisit the assumption that cloud-based inference is intrinsically unsuitable for latency-sensitive control tasks.
  arXiv  Detail & Related papers  (2026-02-17T20:44:13Z)
• AdaSwitch: An Adaptive Switching Meta-Algorithm for Learning-Augmented Bounded-Influence Problems [9.387255955861162]
  We study a class of multi-period online decision-making problems with sequence-based predictions.<n>In each period, the decision-maker observes the realized request and must take an irrevocable action that yields a reward or incurs a cost.<n>We introduce a bounded-influence framework, in which past decisions and requests exert only limited impact on the future optimal reward.<n>Within this framework, we propose the AdaSwitch meta-algorithm, which exploits predictions to attain performance close to the offline benchmark when predictions are accurate.
  arXiv  Detail & Related papers  (2025-09-02T13:26:23Z)
• Online Decision-Focused Learning [63.83903681295497]
  Decision-focused learning (DFL) is an increasingly popular paradigm for training predictive models whose outputs are used in decision-making tasks.<n>We investigate DFL in dynamic environments where the objective function does not evolve over time.<n>We establish bounds on the expected dynamic regret, both when decision space is a simplex and when it is a general bounded convex polytope.
  arXiv  Detail & Related papers  (2025-05-19T10:40:30Z)
• Global-Decision-Focused Neural ODEs for Proactive Grid Resilience Management [50.34345101758248]
  We propose predict-all-then-optimize-globally (PATOG), a framework that integrates outage prediction with globally optimized interventions. Our approach ensures spatially and temporally coherent decision-making, improving both predictive accuracy and operational efficiency. Experiments on synthetic and real-world datasets demonstrate significant improvements in outage prediction consistency and grid resilience.
  arXiv  Detail & Related papers  (2025-02-25T16:15:35Z)
• Understanding Optimization in Deep Learning with Central Flows [53.66160508990508]
  We show that an RMS's implicit behavior can be explicitly captured by a "central flow:" a differential equation. We show that these flows can empirically predict long-term optimization trajectories of generic neural networks.
  arXiv  Detail & Related papers  (2024-10-31T17:58:13Z)
• Switchable Decision: Dynamic Neural Generation Networks [98.61113699324429]
  We propose a switchable decision to accelerate inference by dynamically assigning resources for each data instance. Our method benefits from less cost during inference while keeping the same accuracy.
  arXiv  Detail & Related papers  (2024-05-07T17:44:54Z)
• Learning Logic Specifications for Policy Guidance in POMDPs: an Inductive Logic Programming Approach [57.788675205519986]
  We learn high-quality traces from POMDP executions generated by any solver. We exploit data- and time-efficient Indu Logic Programming (ILP) to generate interpretable belief-based policy specifications. We show that learneds expressed in Answer Set Programming (ASP) yield performance superior to neural networks and similar to optimal handcrafted task-specifics within lower computational time.
  arXiv  Detail & Related papers  (2024-02-29T15:36:01Z)
• Successive Refinement in Large-Scale Computation: Advancing Model Inference Applications [67.76749044675721]
  We introduce solutions for layered-resolution computation. These solutions allow lower-resolution results to be obtained at an earlier stage than the final result.
  arXiv  Detail & Related papers  (2024-02-11T15:36:33Z)
• Adaptive Decision-Making with Constraints and Dependent Losses: Performance Guarantees and Applications to Online and Nonlinear Identification [5.787117733071415]
  We consider adaptive decision-making problems where an agent optimize a cumulative performance objective by repeatedly choosing among a finite set of options. Our algorithm and our analysis is instance dependent, that is, suboptimal choices of the environment are exploited and reflected in our regret bounds. The performance of the resulting algorithms is highlighted in two numerical examples.
  arXiv  Detail & Related papers  (2023-04-06T18:32:26Z)
• Adaptive Information Belief Space Planning [9.365993173260316]
  We focus on making informed decisions efficiently, using reward functions that explicitly deal with uncertainty. We derive bounds on the expected information-theoretic reward function and, as a consequence, on the value function. We then propose a method to refine aggregation to achieve identical action selection with a fraction of the computational time.
  arXiv  Detail & Related papers  (2022-01-14T21:12:00Z)
• Learning-based decentralized offloading decision making in an adversarial environment [1.9978675755638664]
  Vehicular fog computing (VFC) pushes the cloud computing capability to the distributed fog nodes at the edge of the Internet. In this article, we develop a new adversarial online algorithm with bandit feedback based on the adversarial multi-armed bandit theory. We theoretically prove that the input-size dependent selection rule allows to choose a suitable fog node without exploring the sub-optimal actions.
  arXiv  Detail & Related papers  (2021-04-26T19:04:55Z)
• Towards Streaming Perception [70.68520310095155]
  We present an approach that coherently integrates latency and accuracy into a single metric for real-time online perception. The key insight behind this metric is to jointly evaluate the output of the entire perception stack at every time instant. We focus on the illustrative tasks of object detection and instance segmentation in urban video streams, and contribute a novel dataset with high-quality and temporally-dense annotations.
  arXiv  Detail & Related papers  (2020-05-21T01:51:35Z)
• Learning with Differentiable Perturbed Optimizers [54.351317101356614]
  We propose a systematic method to transform operations into operations that are differentiable and never locally constant. Our approach relies on perturbeds, and can be used readily together with existing solvers. We show how this framework can be connected to a family of losses developed in structured prediction, and give theoretical guarantees for their use in learning tasks.
  arXiv  Detail & Related papers  (2020-02-20T11:11:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.