← Search

Hemanth Saratchandran

21 accepted papers

2026

Can Transformers Really Do It All? On the Compatibility of Inductive Biases Across Tasks

ICLR 2026poster

Transformers are remarkably versatile and their design is largely consistent across a variety of applications. But are they optimal for any given task or dataset? The answer may be key for pushing AI beyond merely scaling current designs. **Method.** We present a method to optimize a transformer ar…

Cited by 0SourceScholar
2026

Can You Learn to See Without Images? Procedural Warm-Up for Vision Transformers

CVPR 2026

Transformers are remarkably versatile, suggesting the existence of generic inductive biases beneficial across modalities. In this work, we explore a new way to instil such biases in vision transformers (ViTs) through pretraining on procedurally generated data devoid of visual or semantic content. We

Cited by 0SourceScholar
2026

Cutting the Skip: Training Residual-Free Transformers

ICLR 2026poster

Transformers have achieved remarkable success across a wide range of applications, a feat often attributed to their scalability. Yet training them without residual (skip) connections remains notoriously difficult. While skips stabilize optimization, they also disrupt the hierarchical structure of re…

Cited by 0SourceScholar
2026

Procedural Pretraining: Warming Up Language Models with Abstract Data

ICML 2026oral

Pretraining directly on web-scale corpora is the de facto paradigm for building language models. We study an alternative setting where the model is initially exposed to abstract structured data, as a means to ease the subsequent acquisition of rich semantic knowledge, much like humans learn simple l…

Cited by 0SourceScholar
2026

SineLoRA∆: Sine-Activated Delta Compression

AAAI 2026technical

Resource-constrained weight deployment is a task of immense practical importance. Recently, there has been interest in the specific task of Delta Compression, where parties each hold a common base model and only communicate compressed weight updates. However, popular parameter efficient updates such

Cited by 0SourcePDFScholar
2025

Efficient Learning with Sine-Activated Low-Rank Matrices

ICLR 2025poster

Low-rank decomposition has emerged as a vital tool for enhancing parameter efficiency in neural network architectures, gaining traction across diverse applications in machine learning. These techniques significantly lower the number of parameters, striking a balance between compactness and performan…

Cited by 0SourcePDFScholar
2025

Preconditioners for the Stochastic Training of Neural Fields

CVPR 2025poster

Neural fields encode continuous multidimensional signals as neural networks, enabling diverse applications in computer vision, robotics, and geometry. While Adam is effective for stochastic optimization, it often requires long training times. To address this, we explore alternative optimization tech…

2025

RandLoRA: Full rank parameter-efficient fine-tuning of large models

ICLR 2025poster

Low-Rank Adaptation (LoRA) and its variants have shown impressive results in reducing the number of trainable parameters and memory requirements of large transformer networks while maintaining fine-tuning performance. The low-rank nature of the weight update inherently limits the representation powe…

Cited by 0SourcePDFScholar
2025

Towards Higher Effective Rank in Parameter-Efficient Fine-tuning using Khatri-Rao Product

ICCV 2025poster

Parameter-efficient fine-tuning (PEFT) has become a standard for adapting large pre-trained models. While low-rank adaptation (LoRA) has achieved notable success, recent studies highlight its limitations when compared to full-rank variants, particularly when scaling to demanding tasks such as vision…

2024

A sampling theory perspective on activations for implicit neural representations

ICML 2024poster

Implicit Neural Representations (INRs) have gained popularity for encoding signals as compact, differentiable entities. While commonly using techniques like Fourier positional encodings or non-traditional activation functions (e.g., Gaussian, sinusoid, or wavelets) to capture high-frequency content,…

Cited by 6SourcePDFScholar
2024

From Activation to Initialization: Scaling Insights for Optimizing Neural Fields

CVPR 2024highlight

In the realm of computer vision Neural Fields have gained prominence as a contemporary tool harnessing neural networks for signal representation. Despite the remarkable progress in adapting these networks to solve a variety of problems the field still lacks a comprehensive theoretical framework. Thi…

Cited by 2SourcePDFScholar
2023

Curvature-Aware Training for Coordinate Networks

ICCV 2023poster

Coordinate networks are widely used in computer vision due to their ability to represent signals as compressed, continuous entities. However, training these networks with first-order optimizers can be slow, hindering their use in real-time applications. Recent works have opted for shallow voxel-base…

Cited by 8PDFcodeScholar
2023

How much does Initialization Affect Generalization?

ICML 2023poster

Characterizing the remarkable generalization properties of over-parameterized neural networks remains an open problem. A growing body of recent literature shows that the bias of stochastic gradient descent (SGD) and architecture choice implicitly leads to better generalization. In this paper, we sho…

Cited by 10SourcePDFScholar
2023

On skip connections and normalisation layers in deep optimisation

NeurIPS 2023poster

We introduce a general theoretical framework, designed for the study of gradient optimisation of deep neural networks, that encompasses ubiquitous architecture choices including batch normalisation, weight normalisation and skip connections. Our framework determines the curvature and regularity pro…

Cited by 0SourcePDFScholar