← Search

Radu Marculescu

17 accepted papers

2026

Fuel Gauge: Estimating Chain-of-Thought Length Ahead of Time in Large Multimodal Models

CVPR 2026

Reasoning Large Multi-modality Models (LMMs) have become the de facto choice for many applications. However, these models rely on a Chain-of-Thought (CoT) process that is lengthy and unpredictable at runtime, often resulting in inefficient use of computational resources (due to memory fragmentation)

Cited by 0SourceScholar
2026

NeuS-QA: Grounding Long-Form Video Understanding in Temporal Logic and Neuro-Symbolic Reasoning

AAAI 2026technical

While vision-language models (VLMs) excel at tasks involving single images or short videos, they still struggle with Long Video Question Answering (LVQA) due to its demand for complex multi-step temporal reasoning. Vanilla approaches, which simply sample frames uniformly and feed them to a VLM along

Cited by 0SourcePDFScholar
2026

Single-Round Scalable Analytic Federated Learning

CVPR 2026

Federated Learning (FL) is plagued by two key challenges: high communication overhead and performance collapse on heterogeneous (non-IID) data. Analytic FL (AFL) provides a single-round, data distribution invariant solution, but is limited to linear models. Subsequent non-linear approaches, like Dee

Cited by 0SourceScholar
2025

EffiDec3D: An Optimized Decoder for High-Performance and Efficient 3D Medical Image Segmentation

CVPR 2025highlight

Recent 3D deep networks such as SwinUNETR, SwinUNETRv2, and 3D UX-Net have shown promising performance by leveraging self-attention and large-kernel convolutions to capture the volumetric context. However, their substantial computational requirements limit their use in real-time and resource-constra…

2025

LoMix: Learnable Weighted Multi-Scale Logits Mixing for Medical Image Segmentation

NeurIPS 2025poster

U‑shaped networks output logits at multiple spatial scales, each capturing a different blend of coarse context and fine detail. Yet, training still treats these logits in isolation—either supervising only the final, highest‑resolution logits or applying deep supervision with identical loss weights a…

Cited by 0SourcecodeScholar
2025

Mitigating Intra- and Inter-modal Forgetting in Continual Learning of Unified Multimodal Models

NeurIPS 2025poster

Unified Multimodal Generative Models (UMGMs) unify visual understanding and image generation within a single autoregressive framework. However, their ability to continually learn new tasks is severely hindered by catastrophic forgetting, both within a modality (intra-modal) and across modalities (in…

Cited by 0SourceScholar
2024

EMCAD: Efficient Multi-scale Convolutional Attention Decoding for Medical Image Segmentation

CVPR 2024poster

An efficient and effective decoding mechanism is crucial in medical image segmentation especially in scenarios with limited computational resources. However these decoding mechanisms usually come with high computational costs. To address this concern we introduce EMCAD a new efficient multi-scale co…

2024

GreedyViG: Dynamic Axial Graph Construction for Efficient Vision GNNs

CVPR 2024poster

Vision graph neural networks (ViG) offer a new avenue for exploration in computer vision. A major bottleneck in ViGs is the inefficient k-nearest neighbor (KNN) operation used for graph construction. To solve this issue we propose a new method for designing ViGs Dynamic Axial Graph Construction (DAG…

2023

Efficient Low-rank Backpropagation for Vision Transformer Adaptation

NeurIPS 2023poster

The increasing scale of vision transformers (ViT) has made the efficient fine-tuning of these large models for specific needs a significant challenge in various applications. This issue originates from the computationally demanding matrix multiplications required during the backpropagation process t…

Cited by 11SourcePDFScholar
2023

REVISITING PRUNING AT INITIALIZATION THROUGH THE LENS OF RAMANUJAN GRAPH

ICLR 2023top-5%

Pruning neural networks at initialization (PaI) has received an upsurge of interest due to its end-to-end saving potential. PaI is able to find sparse subnetworks at initialization that can achieve comparable performance to the full networks. These methods can surpass the trivial baseline of random…

2023

TIPS: Topologically Important Path Sampling for Anytime Neural Networks

ICML 2023poster

Anytime neural networks (AnytimeNNs) are a promising solution to adaptively adjust the model complexity at runtime under various hardware resource constraints. However, the manually-designed AnytimeNNs are biased by designers' prior experience and thus provide sub-optimal solutions. To address the l…

Cited by 1SourcePDFScholar
2023

ZiCo: Zero-shot NAS via inverse Coefficient of Variation on Gradients

ICLR 2023top-25%

Neural Architecture Search (NAS) is widely used to automatically obtain the neural network with the best performance among a large number of candidate architectures. To reduce the search time, zero-shot NAS aims at designing training-free proxies that can predict the test performance of a given arch…

2021

Anytime Depth Estimation with Limited Sensing and Computation Capabilities on Mobile Devices

CoRL 2021poster

Depth estimation is a safety critical and energy sensitive method for environment sensing. However, in real applications, the depth estimation may be halted at any time, due to the random interruptions or low energy capacity of battery when using powerful sensors like 3D LiDAR. To address this probl…

Cited by 4SourceScholar
2021

How Does Topology Influence Gradient Propagation and Model Performance of Deep Networks With DenseNet-Type Skip Connections?

CVPR 2021poster

DenseNets introduce concatenation-type skip connections that achieve state-of-the-art accuracy in several computer vision tasks. In this paper, we reveal that the topology of the concatenation-type skip connections is closely related to the gradient propagation which, in turn, enables a predictable…

Cited by 29PDFcodeScholar
2020

On Network Science and Mutual Information for Explaining Deep Neural Networks

ICASSP 2020accepted

In this paper, we present a new approach to interpret deep learning models. By coupling mutual information with network science, we explore how information flows through feedforward networks. We show that efficiently approximating mutual information allows us to create an information measure that qu…

Cited by 0SourceScholar