← Search

Akshay Mehra

7 accepted papers

2026

DPAR: Dynamic Patchification for Efficient Autoregressive Visual Generation

CVPR 2026

Decoder-only autoregressive image generation typically relies on fixed-length tokenization schemes whose token counts grow quadratically with resolution, substantially increasing the computational and memory demands of attention. We present DPAR, a novel decoder-only autoregressive model that dynami

Cited by 0SourcecodeScholar
2025

A Quantitative Metric Selection Approach for Time-series Forecasting Foundation Models

ICASSP 2025accepted

The recent emergence of time-series forecasting foundation models allows for prediction of any time series without the need of extra training. To select the best foundation model, researchers often use a random metric (e.g., MAE) and apply it to historical observations whose future values are alread…

Cited by 0SourceScholar
2025

DPCore: Dynamic Prompt Coreset for Continual Test-Time Adaptation

ICML 2025poster

Continual Test-Time Adaptation (CTTA) seeks to adapt source pre-trained models to continually changing, unseen target domains. While existing CTTA methods assume structured domain changes with uniform durations, real-world environments often exhibit dynamic patterns where domains recur with varying…

Cited by 0SourcePDFScholar
2024

Understanding the Transferability of Representations via Task-Relatedness

NeurIPS 2024poster

The growing popularity of transfer learning due to the availability of models pre-trained on vast amounts of data, makes it imperative to understand when the knowledge of these pre-trained models can be transferred to obtain high-performing models on downstream target tasks. However, the exact condi…

2022

A Spectral View of Randomized Smoothing under Common Corruptions: Benchmarking and Improving Certified Robustness

ECCV 2022poster

"Certified robustness guarantee gauges a model’s resistance to test-time attacks and can assess the model’s readiness for deployment in the real world. In this work, we explore a new problem setting to critically examine how the adversarial robustness guarantees change when state-of-the-art randomiz…

Cited by 20SourcePDFScholar
2021

How Robust Are Randomized Smoothing Based Defenses to Data Poisoning?

CVPR 2021poster

Predictions of certifiably robust classifiers remain constant in a neighborhood of a point, making them resilient to test-time attacks with a guarantee. In this work, we present a previously unrecognized threat to robust machine learning models that highlights the importance of training-data quality…

Cited by 41PDFcodeScholar
2021

Understanding the Limits of Unsupervised Domain Adaptation via Data Poisoning

NeurIPS 2021poster

Unsupervised domain adaptation (UDA) enables cross-domain learning without target domain labels by transferring knowledge from a labeled source domain whose distribution differs from that of the target. However, UDA is not always successful and several accounts of `negative transfer' have been repor…