SearcharxivSearch

arXiv subjects

Jean-michel Morel

Publications and source records attributed to Jean-michel Morel.

4 recordsLinked to original sources

Improving Diffusion Generative Models via Truncated Karhunen--Loève Expansion

Pretrained diffusion models exhibit a well-known training-sampling mismatch, often attributed to exposure bias and related distribution-shift effects. We provide a quantitative interpretation of this phenomenon through the notion of an effective noise level: empirically, a pretrained denoiser behaves as if trained at a noise level slightly below the nominal schedule. Motivated by this observation, we introduce a training-free sampling strategy based on truncating the Karhunen--Loève (KL) expansion of the Brownian motion driving the forward stochastic differential equation. Truncation yields a finite-dimensional forward process with a reduced noise level that can be adjusted independently of the time discretization. We prove uniform convergence of the truncated process to the original diffusion. To explain the resulting behaviour, we analyse a toy model in which the denoiser is exact but operates at a reduced effective noise level. The analysis predicts a non-monotone response to the sampling noise with a unique interior optimum, located by a one-dimensional sweep over the truncation order. We implement the approach through corresponding truncated reverse-time and probability-flow equations, without modifying the network architecture. Across CIFAR-10, CelebA, ImageNet, and latent-space Stable Diffusion, the truncation order consistently reveals a sweet spot, improving pretrained models in nearly all tested configurations. Training from scratch at a matched truncation order makes that order the network's own sweet spot, accelerates convergence by about $2.8\times$, and lowers the generation error on CIFAR-10 (Fréchet Inception Distance 7.14 to 5.47 at matched epochs; best checkpoint 6.74 to 5.23). A Lévy--Ciesielski comparison confirms that finite expansion is broadly beneficial.

cs.CV

Extending Pretrained 10-Second ECG Foundation Models to Longer Horizons

Electrocardiogram (ECG) foundation models pretrained on typical diagnostic 10-second ECG segments, have demonstrated strong transferability across a range of clinical applications. However, many real-world applications produce recordings that are typically longer, and are varied in duration during inference time. These 10-second models have no built-in way to combine information across time. Extending them to longer horizons introduces two challenges: structural incompatibilities arising from input-length disparities, and semantic challenges that limit meaningful temporal aggregation. We propose a parameter-efficient framework that extends pretrained ECG foundation models to longer and variable-length ECGs without retraining the backbone. Guided by a frozen pretrained 10-second model, we introduce a lightweight plug-in module that extends the model in two complementary ways: (i) structurally compatible long-sequence processing and (ii) semantically informed temporal modeling. Experiments on multiple long-horizon ECG tasks, datasets, and foundation model backbones demonstrate that our method enables robust long-horizon extension from pretrained snapshot models, consistently outperforming sliding-window and pooling-based baselines with strong parameter efficiency.

cs.LG

Redefining Temporal Modeling in Video Diffusion: The Vectorized Timestep Approach

Diffusion models have revolutionized image generation, and their extension to video generation has shown promise. However, current video diffusion models~(VDMs) rely on a scalar timestep variable applied at the clip level, which limits their ability to model complex temporal dependencies needed for various tasks like image-to-video generation. To address this limitation, we propose a frame-aware video diffusion model~(FVDM), which introduces a novel vectorized timestep variable~(VTV). Unlike conventional VDMs, our approach allows each frame to follow an independent noise schedule, enhancing the model's capacity to capture fine-grained temporal dependencies. FVDM's flexibility is demonstrated across multiple tasks, including standard video generation, image-to-video generation, video interpolation, and long video synthesis. Through a diverse set of VTV configurations, we achieve superior quality in generated videos, overcoming challenges such as catastrophic forgetting during fine-tuning and limited generalizability in zero-shot methods.Our empirical evaluations show that FVDM outperforms state-of-the-art methods in video generation quality, while also excelling in extended tasks. By addressing fundamental shortcomings in existing VDMs, FVDM sets a new paradigm in video synthesis, offering a robust framework with significant implications for generative modeling and multimedia applications.

cs.CV

Adapting MIMO video restoration networks to low latency constraints

MIMO (multiple input, multiple output) approaches are a recent trend in neural network architectures for video restoration problems, where each network evaluation produces multiple output frames. The video is split into non-overlapping stacks of frames that are processed independently, resulting in a very appealing trade-off between output quality and computational cost. In this work we focus on the low-latency setting by limiting the number of available future frames. We find that MIMO architectures suffer from problems that have received little attention so far, namely (1) the performance drops significantly due to the reduced temporal receptive field, particularly for frames at the borders of the stack, (2) there are strong temporal discontinuities at stack transitions which induce a step-wise motion artifact. We propose two simple solutions to alleviate these problems: recurrence across MIMO stacks to boost the output quality by implicitly increasing the temporal receptive field, and overlapping of the output stacks to smooth the temporal discontinuity at stack transitions. These modifications can be applied to any MIMO architecture. We test them on three state-of-the-art video denoising networks with different computational cost. The proposed contributions result in a new state-of-the-art for low-latency networks, both in terms of reconstruction error and temporal consistency. As an additional contribution, we introduce a new benchmark consisting of drone footage that highlights temporal consistency issues that are not apparent in the standard benchmarks.

cs.CV