SearcharxivSearch

arXiv subjects

Daksh Aggarwal

Publications and source records attributed to Daksh Aggarwal.

9 recordsLinked to original sources

Brill-Noether theory for totally ramified covers of the projective line

Given a curve $C$ that is a degree $k$ cover $C \to \mathbb{P}^1$ totally ramified at two points $p$ and $q$, we can seek to understand the space of degree $d$ line bundles on $C$ with prescribed ramification at $p$ and $q$. The corresponding subschemes of $\text{Pic}^d(C)$ are called transmission loci and are parameterized via elements of the (extended) $k$-affine symmetric group $\widetilde{\Sigma}_k$. Transmission loci provide a refinement of the splitting loci that have recently been extensively studied for $k$-gonal curves. Pflueger has conjectured analogues of the classic Brill-Noether theorem should hold for transmission loci. In this paper we prove Pflueger's conjectures.

math.AG

Goal Force: Teaching Video Models To Accomplish Physics-Conditioned Goals

Recent advancements in video generation have enabled the development of ``world models'' capable of simulating potential futures for robotics and planning. However, specifying precise goals for these models remains a challenge; text instructions are often too abstract to capture physical nuances, while target images are frequently infeasible to specify for dynamic tasks. To address this, we introduce Goal Force, a novel framework that allows users to define goals via explicit force vectors and intermediate dynamics, mirroring how humans conceptualize physical tasks. We train a video generation model on a curated dataset of synthetic causal primitives-such as elastic collisions and falling dominos-teaching it to propagate forces through time and space. Despite being trained on simple physics data, our model exhibits remarkable zero-shot generalization to complex, real-world scenarios, including tool manipulation and multi-object causal chains. Our results suggest that by grounding video generation in fundamental physical interactions, models can emerge as implicit neural physics simulators, enabling precise, physics-aware planning without reliance on external engines. We release all datasets, code, model weights, and interactive video demos at our project page.

cs.CV

Force Prompting: Video Generation Models Can Learn and Generalize Physics-based Control Signals

Recent advances in video generation models have sparked interest in world models capable of simulating realistic environments. While navigation has been well-explored, physically meaningful interactions that mimic real-world forces remain largely understudied. In this work, we investigate using physical forces as a control signal for video generation and propose force prompts which enable users to interact with images through both localized point forces, such as poking a plant, and global wind force fields, such as wind blowing on fabric. We demonstrate that these force prompts can enable videos to respond realistically to physical control signals by leveraging the visual and motion prior in the original pretrained model, without using any 3D asset or physics simulator at inference. The primary challenge of force prompting is the difficulty in obtaining high quality paired force-video training data, both in the real world due to the difficulty of obtaining force signals, and in synthetic data due to limitations in the visual quality and domain diversity of physics simulators. Our key finding is that video generation models can generalize remarkably well when adapted to follow physical force conditioning from videos synthesized by Blender, even with limited demonstrations of few objects. Our method can generate videos which simulate forces across diverse geometries, settings, and materials. We also try to understand the source of this generalization and perform ablations that reveal two key elements: visual diversity and the use of specific text keywords during training. Our approach is trained on only around 15k training examples for a single day on four A100 GPUs, and outperforms existing methods on force adherence and physics realism, bringing world models closer to real-world physics interactions. We release all datasets, code, weights, and interactive video demos at our project page.

cs.CV

Fourier Head: Helping Large Language Models Learn Complex Probability Distributions

As the quality of large language models has improved, there has been increased interest in using them to model non-linguistic tokens. For example, the Decision Transformer recasts agentic decision making as a sequence modeling problem, using a decoder-only LLM to model the distribution over the discrete action space for an Atari agent. However, when adapting LLMs to non-linguistic domains, it remains unclear if softmax over discrete bins captures the continuous structure of the tokens and the potentially complex distributions needed for high quality token generation. We introduce a neural network layer, constructed using Fourier series, which we can easily substitute for any linear layer if we want the outputs to have a more continuous structure. We perform extensive analysis on synthetic datasets, as well as on large-scale decision making and time series forecasting tasks. We also provide theoretical evidence that this layer can better learn signal from data while ignoring high-frequency noise. All of our results support the effectiveness of our proposed Fourier head in scenarios where the underlying data distribution has a natural continuous structure. For example, the Fourier head improves a Decision Transformer agent's returns across four benchmark Atari games by as much as 377%, and increases a state-of-the-art times series foundation model's forecasting performance by 3.5% across 20 benchmarks unseen during training.

cs.LG

Self-Correcting Self-Consuming Loops for Generative Model Training

As synthetic data becomes higher quality and proliferates on the internet, machine learning models are increasingly trained on a mix of human- and machine-generated data. Despite the successful stories of using synthetic data for representation learning, using synthetic data for generative model training creates "self-consuming loops" which may lead to training instability or even collapse, unless certain conditions are met. Our paper aims to stabilize self-consuming generative model training. Our theoretical results demonstrate that by introducing an idealized correction function, which maps a data point to be more likely under the true data distribution, self-consuming loops can be made exponentially more stable. We then propose self-correction functions, which rely on expert knowledge (e.g. the laws of physics programmed in a simulator), and aim to approximate the idealized corrector automatically and at scale. We empirically validate the effectiveness of self-correcting self-consuming loops on the challenging human motion synthesis task, and observe that it successfully avoids model collapse, even when the ratio of synthetic data to real data is as high as 100%.

cs.LG

A Selberg Trace Formula for $\text{GL}_{3}(\mathbb{F}_p)\backslash \text{GL}_{3}(\mathbb{F}_q)/K$

In this paper, we prove a discrete analog of the Selberg Trace Formula for the group $\text{GL}_{3}(\mathbb{F}_q).$ By considering a cubic extension of the finite field $\mathbb{F}_q$, we define an analog of the upper half space and an action of $\text{GL}_{3}(\mathbb{F}_q)$ on it. To compute the orbital sums we explicitly identify the double coset spaces and fundamental domains in our upper half space. To understand the spectral side of the trace formula we decompose the induced representation $\rho = \text{Ind}_{\Gamma}^{G} 1$ for $G= \text{GL}_{3}(\mathbb{F}_q) $ and $ \Gamma = \text{GL}_{3}(\mathbb{F}_p).$

math.NT

N\"other Currents, Black Hole Entropy Universality and CFT Duality in Conformal Weyl Gravity

In this paper we study black hole entropy universality within the Conformal Weyl gravity paradigm. We do this by first computing the entropy of specific vacuum and non-vacuum solutions, previously unexplored in Conformal Weyl gravity via both the N\"other current method and Wald's entropy formula. For the vacuum case, we explore the near horizon near extremal Kerr metric, which is also a vacuum solution to Conformal Weyl gravity and not previously studied in this setting. For the non-vacuum case we couple the conformal Weyl gravity field equations to a near horizon (linear) $U(1)$ gauge potential and analyze the respective found solutions. We highlight the non-universality of black hole entropy between our studied black hole solutions of varying symmetries. However despite non-universality, the respective black hole entropies are in congruence with Wald's entropy formula for the specific gravity theory. Finally and despite non-universality, we comment on the construction of a near horizon CFT dual to one of our unique non-vacuum solutions. Due to the non-universality, we must introduce a parameter (similarly to entropy calculations in LQG) which we also call $\gamma$ and relating to the Weyl anomaly coefficient. The construction follows an $AdS_2/CFT_1$ correspondence in the near horizon, which enables the computation of the full asymptotic symmetry group of the chosen non-vacuum conformal Weyl black hole and its near horizon quantum CFT dual. We conclude with a discussion and outlook for future work.

hep-th

A conjectural asymptotic formula for multiplicative chaos in number theory

We investigate a special sequence of random variables $A(N)$ defined by an exponential power series with independent standard complex Gaussians $(X(k))_{k \geq 1}$. Introduced by Hughes, Keating, and O'Connell in the study of random matrix theory, this sequence relates to Gaussian multiplicative chaos (in particular "holomorphic multiplicative chaos'' per Najnudel, Paquette, and Simm) and random multiplicative functions. Soundararajan and Zaman recently determined the order of $\mathbb{E}[|A(N)|]$. By constructing an algorithm to calculate $A(N)$ in $O(N^2 \log N)$ steps, we produce computational evidence that their result can likely be strengthened to an asymptotic result with a numerical estimate for the asymptotic constant. We also obtain similar conclusions when $A(N)$ is defined using standard real Gaussians or uniform $\pm 1$ random variables. However, our evidence suggests that the asymptotic constants do not possess a natural product structure.

math.NT