Arno Solin

Arno Solin

@arnosolin.bsky.social

Associate Professor in Machine Learning, Aalto University. ELLIS Scholar. http://arno.solin.fi

612 followers85 following65 posts

🔥 #LeAVJEPA: A simple recipe for self-supervised learning from sound and vision 🔥 One shared encoder, trained without class labels. Dropping a modality makes audio & video learn a common representation. 🧵

View full thread

5/ In the video, audio-to-video attention follows the sound-producing objects, although the model received no localisation supervision. With attentive probes on frozen ViT-L features, we obtain 36.0 mAP on AudioSet-20K and 91.3% accuracy on ESC-50.

🔥 #LeAVJEPA: A simple recipe for self-supervised learning from sound and vision 🔥 One shared encoder, trained without class labels. Dropping a modality makes audio & video learn a common representation. 🧵

View full thread

3/ The important detail is how we construct the views. When every view contains both modalities, matching them can be solved by relying on just one. Modality dropout makes that shortcut harder, and our controlled ablation shows a clear improvement in the learned features.

4/ Embedding alignment brings the views together and LeJEPA's SIGReg regularizer prevents collapse. Pretraining needs no EMA teacher, separate predictor, reconstruction decoder, or contrastive negatives.

🔥 #LeAVJEPA: A simple recipe for self-supervised learning from sound and vision 🔥 One shared encoder, trained without class labels. Dropping a modality makes audio & video learn a common representation. 🧵

2/ In #LeAVJEPA, we extend #LeJEPA to audio and video using one shared transformer. During training, 🎤 audio-only and 📹 video-only views learn to match a representation formed from both modalities.

3D Gaussian splats are amazing--until you realise how much storage space they need. Smol-GS makes #3DGS actually small: explicit splats, tiny learned features w/ positional awareness, octree-coded geometry, and fast rendering. 🥇Now leading the 3DGS.zip benchmark.

View full thread

3D Gaussian splats are amazing--until you realise how much storage space they need. Smol-GS makes #3DGS actually small: explicit splats, tiny learned features w/ positional awareness, octree-coded geometry, and fast rendering. 🥇Now leading the 3DGS.zip benchmark.

View full thread

5/ Tiny MLPs decode each splat into what the renderer needs: color, opacity, shape, rotation, and view-dependent effects. The features and scale controllers are quantized and entropy-coded. The result is a compact neural splat representation without anchor-offset bookkeeping.

3D Gaussian splats are amazing--until you realise how much storage space they need. Smol-GS makes #3DGS actually small: explicit splats, tiny learned features w/ positional awareness, octree-coded geometry, and fast rendering. 🥇Now leading the 3DGS.zip benchmark.

View full thread

3/ Most strong 3DGS compression methods are anchor-based: Store shared anchors, use local offsets, and decode splats around them. That works well and has dominated recent benchmarks. But Smol-GS takes a different approach.

4/ In Smol-GS, each splat has a compact learned feature vector. Geometry stays explicit, but coordinates are stored with an occupancy-octree. The same octree also gives a locality-aware positional encoding. In short: explicit geometry + learned local appearance.

3D Gaussian splats are amazing--until you realise how much storage space they need. Smol-GS makes #3DGS actually small: explicit splats, tiny learned features w/ positional awareness, octree-coded geometry, and fast rendering. 🥇Now leading the 3DGS.zip benchmark.

2/ 3DGS gives real-time photorealistic rendering, but the representation is heavy. A scene can easily take hundreds of MBs. That hurts if you care about storage, streaming, editing, mobile, web, VR, or sharing 3D scenes. Can we keep splats explicit, but make them tiny?

1/ 🔥 New paper: Differentiable Vector Quantization (DiVeQ) 🔥 Vector quantization (VQ) is a core tool in modern AI. It connects continuous data like images and audio to discrete tokens used by transformers. It underpins compression, generation, and multimodal modelling.

View full thread

1/ 🔥 New paper: Differentiable Vector Quantization (DiVeQ) 🔥 Vector quantization (VQ) is a core tool in modern AI. It connects continuous data like images and audio to discrete tokens used by transformers. It underpins compression, generation, and multimodal modelling.

View full thread

5/ The result is a direct and general way to do end-to-end trainable quantization, without many of the complications of earlier approaches. We also see improved performance in image compression, image generation, and speech coding.

6/ We have also released a PyTorch package on PyPI: pip install diveq It implements the methods and variants from the paper and makes integration into training pipelines straightforward.

1/ 🔥 New paper: Differentiable Vector Quantization (DiVeQ) 🔥 Vector quantization (VQ) is a core tool in modern AI. It connects continuous data like images and audio to discrete tokens used by transformers. It underpins compression, generation, and multimodal modelling.

View full thread

3/ In our #ICLR2026 paper, we introduce DiVeQ. The idea is simple: keep the hard quantization behavior we want, but make training behave as if learning can still pass through it.

4/ We do this by modelling quantization as adding a carefully constructed error vector. So the forward pass still uses hard assignments, while training gets meaningful gradient flow.

1/ 🔥 New paper: Differentiable Vector Quantization (DiVeQ) 🔥 Vector quantization (VQ) is a core tool in modern AI. It connects continuous data like images and audio to discrete tokens used by transformers. It underpins compression, generation, and multimodal modelling.

2/ The challenge is that VQ uses a hard nearest-codeword decision. That makes learning awkward, because the quantization step is non-differentiable and gradients stop flowing. Existing fixes often add bias and extra tuning.

View full thread

My own research, together with my group, focuses less on building the giant models and more on designing the building blocks behind them: model components, inductive biases, training principles, and inference methods that make AI systems more robust, data-efficient, and uncertainty-aware. 3/n

I'm feeling grateful to colleagues, students, collaborators, and everyone who joined the talk – and excited about the next steps in research on machines that learn, and maybe one day, truly make sense. 🙏✨ 4/n

I talked about "Making Sense of Learning Machines": • How modern machine learning has learned to cope with natural, “chaotic” data – images, text, sound • Why the big breakthroughs of the last 10–15 years matter • What we lack and what we would like to understand 2/n

📣 Please share: We invite submissions to the 29th International Conference on Artificial Intelligence and Statistics (#AISTATS 2026) and welcome paper submissions at the intersection of AI, machine learning, statistics, and related areas. [1/3]

I'm thrilled to be Program Chairing AISTATS 2026 together with Aaditya Ramdas. AISTATS has a special feel to it, and it has been described by many colleagues as their "favourite conference". We aim to preserve that spirit while introducing some fresh elements for 2026. [3/3]

Arno Solin reposted

Remember that computers use bitstrings to represent numbers? We exploit this in our recent @auai.org paper and introduce #BitVI. #BitVI directly learns an approximation in the space of bitstring representations, thus, capturing complex distributions under varying numerical precision regimes.

Real-world #3DGS scenes are messy—occluders, moving objects, and clutter often ruin reconstruction. This #CVPR2025 paper presents DeSplat, which separates static scene content from distractors, all without requiring external semantic models. [1/n]

View full thread

Real-world #3DGS scenes are messy—occluders, moving objects, and clutter often ruin reconstruction. This #CVPR2025 paper presents DeSplat, which separates static scene content from distractors, all without requiring external semantic models. [1/n]

I’m visiting the Isaac Newton Institute for Mathematical Sciences in Cambridge this week. I’m giving an invited talk in the ”Calibrating prediction uncertainty : statistics and machine learning perspectives” workshop on Thursday.

We introduce BitVI, a novel approach for variational inference with discrete bitstring representations of continuous parameters. We use a deterministic probabilistic circuit structure to model the distribution over bitstrings, allowing for exact and efficient probabilistic inference. [2/3]

Excited to share "Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation", presented at the #ICLR2025 "Workshop on Reasoning and Planning for LLMs" on Monday! 🚀 1/3