SearcharxivSearch

arXiv subjects

Ravi Shankar

Publications and source records attributed to Ravi Shankar.

At least 19 recordsLinked to original sources

ReToolSQL: Agentic Reinforcement Learning for Robust Text-to-SQL

Recent work has shown that reinforcement learning from execution feedback can substantially improve text-to-SQL performance, often enabling smaller models to match or exceed much larger systems. However, most existing approaches treat SQL generation as a single-turn task, limiting the model's ability to recover from errors through iterative refinement. We present ReToolSQL, a two-stage training framework for text-to-SQL that combines (i) a supervised warm-start on rejection-sampled reasoning traces with (ii) agentic reinforcement fine-tuning (RFT) over multi-turn tool-use trajectories. The key insight is that the two stages act on complementary axes, the supervised fine-tuning (SFT) on verified privileged-teacher traces expands the set of solvable questions (raising pass@k coverage on the hardest cases), while RFT converts that expanded capability into higher single-pass accuracy by teaching the model when to verify, what evidence to retrieve, and how to repair faulty SQL from execution feedback. Applied to Gemma 4 instruction-tuned (31B), RFT alone achieves 73.66% execution accuracy (EX) on the BIRD-SQL development benchmark (74.12% EX with self-consistency). Initializing RFT from the SFT checkpoint (SFT$\to$RFT) yields our strongest model at 74.32% EX single-pass and 74.77% EX with self-consistency. At the time of writing, this ranked first on the BIRD single-model development-set leaderboard. The approach uses composite rewards anchored on execution correctness, requires no human annotation beyond the benchmark itself, and operates within a single dense 31B model, showing that a properly designed SFT$\to$RFT pipeline over tool-use trajectories is a practical path toward robust enterprise-grade text-to-SQL.

cs.AI

Interior estimates and regularity for the scalar curvature equation in dimension 4

We establish a priori interior curvature estimates for the scalar curvature equation in dimension 4. Our approach relies on the doubling method introduced by Shankar and Yuan [SY25]. Key to the proof are an a priori doubling inequality under a small gradient assumption and the Alexandrov regularity for viscosity solutions; the latter is obtained via a new iterative rotation argument. Furthermore, we establish interior regularity for $C^1$ viscosity solutions.

math.AP

PRISM-CTG: A Foundation Model for Cardiotocography Analysis with Multi-View SSL

Supervised deep learning models for automated CTG analysis are typically constrained by narrowly curated labelled datasets and limited patient cohorts, leaving substantial volumes of physiologically informative clinical recordings untapped. To address this limitation, we propose Physiology-aware Representation Learning via Integrated Self-supervision and Metadata for CTG (PRISM-CTG), a clinically grounded self-supervised foundation model (FM) for CTG that leverages large-scale unlabelled recordings to learn transferable domain-level representations. PRISM-CTG is pretrained using a multi-view self-supervised framework that jointly optimises 3 complementary pretext objectives: random-projected guided masked signal reconstruction, clinical variable prediction, and feature classification. Each objective is associated with a dedicated task-specific token, enabling specialised representation learning, while controlled cross-attention facilitates information exchange across clinical context. By reframing patient metadata and domain knowledge, which are often underutilised in conventional training as prediction targets, Prism-CTG transforms readily available clinical information into additional supervisory targets that guide clinically meaningful representation learning. Extensive experiments across 7 downstream CTG tasks in both antepartum and intrapartum domains demonstrated that PRISM-CTG consistently outperforms in-domain and SSL baselines. Notably, PRISM-CTG demonstrated strong generalisation under external validation on 2 datasets, while achieving comparable performance to studies trained on substantially larger, privately labelled datasets. To our knowledge, this is the first study to introduce large-scale FM for CTG that learns domain-level representations.

cs.LG

Doubling and the two-dimensional critical valued Lagrangian phase

In this paper, we establish interior Hessian and gradient estimates for the two-dimensional Lagrangian mean curvature equation when the phase changes signs, provided the gradient of the phase vanishes along its zero set. At the critical phase in two dimensions, the Jacobi inequality degenerates, preventing the use of higher-dimensional methods to obtain Hessian estimates. To address this difficulty, we introduce a modified doubling technique that applies to degenerate Jacobi inequalities and yields interior estimates.

math.AP

Singularities of the Lagrangian mean curvature flow at the critical Lagrangian phase

We establish interior estimates for singularities of the Lagrangian mean curvature flow when the Lagrangian phase is critical, i.e., $|\Theta|\geq (n-2)\tfrac{\pi}{2}$, and extend our results to the broader class of Lagrangian mean curvature type equations. Our gradient estimates require certain structural conditions, and we construct $C^{\alpha}$ singular viscosity solutions to show that criticality of the phase is necessary, and that these conditions cannot be removed in dimension one. We also introduce a new method for proving $C^{2,\alpha}$ estimates by exponentiating the arctangent operator into a concave one when $|\Theta|\geq (n-2)\tfrac{\pi}{2}$ and $n>2$.

math.AP

Semi-convex viscosity solutions of the special Lagrangian equation

We prove smoothness and interior derivative estimates for viscosity solutions to the special Lagrangian equation with almost negative phases and small enough semi-convexity. We show by example that the range of phases we consider and the semi-convexity condition are sharp. As an application, we find a new Liouville theorem for entire such solutions of the special Lagrangian equation with subcritical phase. We also find effective Hessian estimates with exponential dependence, which we show to be optimal.

math.AP

Large language models surpass domain-specific architectures for antepartum electronic fetal monitoring analysis

Foundation models (FMs) and large language models (LLMs) have demonstrated promising generalization across diverse domains for time-series analysis, yet their potential for electronic fetal monitoring (EFM) and cardiotocography (CTG) analysis remains underexplored. Most existing CTG studies relied on domain-specific models and lack systematic comparisons with modern foundation or language models, limiting our understanding of whether these models can outperform specialized systems in fetal health assessment. In this study, we present the first comprehensive benchmark of state-of-the-art architectures for automated antepartum CTG classification. Over 2,500 20-minutes recordings were used to evaluate over 15 models spanning domain-specific, time-series, foundation, and language-model categories under a unified framework. Fine-tuned LLMs consistently outperformed both foundation and domain-specific models across data-availability scenarios, except when uterine-activity signals were absent, where domain-specific models showed greater robustness. These performance gains, however, required substantially higher computational resources. Our results highlight that while fine-tuned LLMs achieved state-of-the-art performance for CTG classification, practical deployment must balance performance with computational efficiency.

cs.LG

Energy Landscapes Enable Reliable Abstention in Retrieval-Augmented Large Language Models for Healthcare

Reliable abstention is critical for retrieval-augmented generation (RAG) systems, particularly in safety-critical domains such as women's health, where incorrect answers can lead to harm. We present an energy-based model (EBM) that learns a smooth energy landscape over a dense semantic corpus of 2.6M guideline-derived questions, enabling the system to decide when to generate or abstain. We benchmark the EBM against a calibrated softmax baseline and a k-nearest neighbour (kNN) density heuristic across both easy and hard abstention splits, where hard cases are semantically challenging near-distribution queries. The EBM achieves superior abstention performance abstention on semantically hard cases, reaching AUROC 0.961 versus 0.950 for softmax, while also reducing FPR@95 (0.235 vs 0.331). On easy negatives, performance is comparable across methods, but the EBM's advantage becomes most pronounced in safety-critical hard distributions. A comprehensive ablation with controlled negative sampling and fair data exposure shows that robustness stems primarily from the energy scoring head, while the inclusion or exclusion of specific negative types (hard, easy, mixed) sharpens decision boundaries but is not essential for generalisation to hard cases. These results demonstrate that energy-based abstention scoring offers a more reliable confidence signal than probability-based softmax confidence, providing a scalable and interpretable foundation for safe RAG systems.

cs.CL

EDD-NSTE: Edge Data Distribution as a Network Steiner Tree Estimation in Edge Computing

Edge computing is a distributed computing paradigm that brings computation and data storage closer to the user's geographical location to improve response times and save bandwidth. It also helps to power a variety of applications requiring low latency. These application data hosted on the cloud needs to be transferred to the respective edge servers in a specific area to help provide low-latency app functionalities to the users of that area. Meanwhile, these arbitrary heavy data transactions from the cloud to the edge servers result in high cost and time penalties. Thus, we need an application data distribution strategy that minimizes these penalties within the app vendors' specific latency constraint. In this work, we provide a refined formulation of an optimal approach to solve this Edge Data Distribution (EDD) problem using Integer Programming (IP) technique. Due to the time complexity limitation of the IP approach, we suggest an O(k) approximation algorithm based on network Steiner tree estimation (EDD-NSTE) for estimating solutions to dense, large-scale EDD problems. Integer Programming and EDD-NSTE are evaluated on a standard real-world EUA data set and the result demonstrates that EDD-NSTE significantly outperforms with a performance margin of 86.67% over the other three representative approaches and the state-of-the-art approach.

cs.DC

Cost-Effective Edge Data Distribution with End-To-End Delay Guarantees in Edge Computing

Cloud Computing is the delivery of computing resources which includes servers, storage, databases, networking, software, analytics, and intelligence over the internet to offer faster innovation, flexible resources, and economies of scale. Since these computing resources are hosted centrally, the data transactions from the cloud to its users can get very expensive. Edge Computing plays a crucial role in minimizing these costs by shifting the data from the cloud to the edge servers located closer to the user's geographical location, thereby providing low-latency app-functionalities to the users of that area. However, the data transaction from the cloud to each of these edge servers can still be expensive both in time and cost. Thus, we need an application data distribution strategy that minimizes these penalities. In this research, we attempt to formulate this Edge Data Distribution as a constrained optimization problem with end-to-end delay guarantees. We then provide an optimal approach to solve this problem using the Integer Programming (IP) technique. Since the IP approach has an exponential time complexity, we also then provide a modified implementation of the EDD-NSTE algorithm, for estimating solutions to large-scale EDD problems. These algorithms are then evaluated on standard real-world datasets named EUA and SLNDC and the result demonstrates that EDD-NSTE significantly outperformed, with a performance margin of 80.35\% over the other representative approaches in comparison.

cs.DC

Removing singularities for fully nonlinear PDEs

We show removability of half-line singularities for viscosity solutions of fully nonlinear elliptic PDEs which have classical density and a Jacobi inequality. An example of such a PDE is the Monge-Amp\`ere equation, and the original proof follows from Caffarelli 1990. Other examples are the minimal surface and special Lagrangian equations. The present paper's quick doubling proof combines Savin's small perturbation theorem with the Jacobi inequality. The method more generally removes singularities satisfying the single side condition.

math.AP

The Interaction Layer: An Exploration for Co-Designing User-LLM Interactions in Parental Wellbeing Support Systems

Parenting brings emotional and physical challenges, from balancing work, childcare, and finances to coping with exhaustion and limited personal time. Yet, one in three parents never seek support. AI systems potentially offer stigma-free, accessible, and affordable solutions. Yet, user adoption often fails due to issues with explainability and reliability. To see if these issues could be solved using a co-design approach, we developed and tested NurtureBot, a wellbeing support assistant for new parents. 32 parents co-designed the system through Asynchronous Remote Communities method, identifying the key challenge as achieving a "successful chat." As part of co-design, parents role-played as NurtureBot, rewriting its dialogues to improve user understanding, control, and outcomes. The refined prototype, featuring an Interaction Layer, was evaluated by 32 initial and 46 new parents, showing improved user experience and usability, with final CUQ score of 91.3/100, demonstrating successful interaction patterns. Our process revealed useful interaction design lessons for effective AI parenting support.

cs.HC

Re-ENACT: Reinforcement Learning for Emotional Speech Generation using Actor-Critic Strategy

In this paper, we propose the first method to modify the prosodic features of a given speech signal using actor-critic reinforcement learning strategy. Our approach uses a Bayesian framework to identify contiguous segments of importance that links segments of the given utterances to perception of emotions in humans. We train a neural network to produce the variational posterior of a collection of Bernoulli random variables; our model applies a Markov prior on it to ensure continuity. A sample from this distribution is used for downstream emotion prediction. Further, we train the neural network to predict a soft assignment over emotion categories as the target variable. In the next step, we modify the prosodic features (pitch, intensity, and rhythm) of the masked segment to increase the score of target emotion. We employ an actor-critic reinforcement learning to train the prosody modifier by discretizing the space of modifications. Further, it provides a simple solution to the problem of gradient computation through WSOLA operation for rhythm manipulation. Our experiments demonstrate that this framework changes the perceived emotion of a given speech utterance to the target. Further, we show that our unified technique is on par with state-of-the-art emotion conversion models from supervised and unsupervised domains that require pairwise training.

eess.AS

A Closer Look at Wav2Vec2 Embeddings for On-Device Single-Channel Speech Enhancement

Self-supervised learned models have been found to be very effective for certain speech tasks such as automatic speech recognition, speaker identification, keyword spotting and others. While the features are undeniably useful in speech recognition and associated tasks, their utility in speech enhancement systems is yet to be firmly established, and perhaps not properly understood. In this paper, we investigate the uses of SSL representations for single-channel speech enhancement in challenging conditions and find that they add very little value for the enhancement task. Our constraints are designed around on-device real-time speech enhancement -- model is causal, the compute footprint is small. Additionally, we focus on low SNR conditions where such models struggle to provide good enhancement. In order to systematically examine how SSL representations impact performance of such enhancement models, we propose a variety of techniques to utilize these embeddings which include different forms of knowledge-distillation and pre-training.

eess.AS

Hessian estimates for special Lagrangian equation by doubling

New, doubling proofs are given for the interior Hessian estimates of the special Lagrangian equation. These estimates were originally shown by Chen-Warren-Yuan in CPAM 2009 and Wang-Yuan in AJM 2014. This yields a higher codimension analogue of Korevaar's 1987 pointwise proof of the gradient estimate for minimal hypersurfaces, without using the Michael-Simon mean value inequality.

math.AP

Regularity for the Monge-Ampère equation by doubling

We give a new proof for the interior regularity of strictly convex solutions of the Monge-Ampère equation. Our approach uses a doubling inequality for the Hessian in terms of the extrinsic distance function on the maximal Lagrangian submanifold determined by the potential equation.

math.AP

Hessian estimates for the sigma-2 equation in dimension four

We derive a priori interior Hessian estimates and interior regularity for the $\sigma_2$ equation in dimension four. Our method provides respectively a new proof for the corresponding three dimensional results and a Hessian estimate for smooth solutions satisfying a dynamic semi-convexity condition in higher $n\ge 5$ dimensions.

math.AP