The paper introduces GROUND, a framework that limits large language model (LLM) analytics to a governed semantic layer for enterprise data warehouses. GROUND supplies approved metrics, dimensions, join paths, filters, and security rules, then validates generated SQL against these constraints before execution, retrying or abstaining on violations. In benchmarks, GROUND eliminates hallucinations across all evaluated categories and prevents row‑level security breaches, outperforming schema‑only, schema‑RAG, and semantic‑only approaches.
By Aravind Sasidharan Pillai
The paper presents a survey of 129 public large language model (LLM) prompt datasets, totaling over 1.22 TB and 673 million instances, and introduces a unified taxonomy for them. By analyzing seven datasets in depth, the authors identify lexical, syntactic, and semantic patterns that differentiate prompts from general text, and evaluate these patterns for tasks such as prompt filtering, source domain routing, and response quality assessment. They demonstrate that a 63‑dimensional linguistic feature set extracted on a CPU can match over 91 % of the F1 score of GPU‑based sentence embeddings while halving latency, and that structural features can effectively route prompts across datasets, though they may negatively impact response quality when prompt length is controlled.
By Yuanming Zhang, Yan Lin, Arijit Khan, Huaiyu Wan
The paper introduces Self-Improving Retrieval-Augmented Generation (RAG), a framework that splits document question answering into Retrieval, Reasoning, and Judge agents coordinated by an orchestrator. When the Judge scores an answer below a dynamic threshold, the system retries with broader retrieval, more careful prompting, and relaxed acceptance criteria, achieving 86% oracle-guided accuracy on FinanceBench with a 36.4% Lazarus Rate. The approach logs every decision with confidence scores, providing audit trails needed for regulated financial applications.
By Junjie Xiong, Shawheen Ghezavat, Aum Hirpara
The paper demonstrates that the common-geodesic condition—where every output triple shares a geodesic point in a metric—does not ensure Fisher consistency for the structured SVM with the standard coordinate-wise argmax decoder. It presents minimal counterexamples, including a four-output star and a tree-metric classification, showing that only path-shaped trees maintain argmax consistency. The study also identifies the smallest full-support counterexamples and provides exact primal-dual certificates for all optimality claims.
By Jintao Fei, Jiangying Luo
The paper introduces a compositional graph embedding framework based on Aitchison geometry, where nodes are represented as simplex-valued mixtures over latent archetypal factors. By embedding these mixtures using isometric log-ratio coordinates, the method preserves Aitchison distances while allowing unconstrained optimization in Euclidean space, yielding intrinsically interpretable embeddings. The approach achieves competitive performance on node classification and link prediction tasks and enables principled component restriction through subcompositional coherence, allowing analysis of how archetype groups influence representations and predictions.
By Nikolaos Nakis, Chrysoula Kosma, Panagiotis Promponas, Michail Chatzianastasis, Giannis Nikolentzos
arXiv:2608. 26552v1 Announce Type: cross Abstract: Randomized sketch-and-solve algorithms accelerate overconstrained $\ell_2$ regression by replacing the input with a smaller problem.
By Zhao Song, Lichen Zhang
Sidecar is a plug‑and‑play semantic augmentation module that preserves entity‑level information from a character’s initial description and injects missing semantics into later prompt embeddings, enabling training‑free character consistency in free‑form visual storytelling. It works with existing diffusion models without architectural changes and incurs negligible computational overhead. Experiments on FreeStoryBench demonstrate consistent improvements in prompt‑image alignment and character consistency across SDXL and FLUX baselines.
By Sibo Dong, Sarah Adel Bargal
The paper introduces Operational Embedding (OpEmbed), a framework that learns compact operational fingerprints of large language model (LLM) cloud services from structured, privacy‑preserving support‑case metadata, without using the case text. OpEmbed aggregates model–time windows into an eight‑channel operational signature and uses temporal contrastive learning, cross‑view reconstruction, and generational‑ordinality regularization to produce a low‑dimensional representation. Evaluated on over 33,000 production support cases across seven LLM families at Google Cloud, OpEmbed recovers interpretable family‑ and version‑level structure, improves leave‑one‑model‑out operational forecasting, remains effective with limited early‑window data, and supports cross‑model fault‑type transfer, providing practical insights for model onboarding, support readiness assessment, and operational monitoring.
By Meiwei Zhang, Eduardo Miranda, Bruce Baynes, Suvigya Jain, Wanlong Chen, Tao He, Sergey Borodavkin
The survey reviews how Large Language Models (LLMs) are being used in High‑Performance Computing (HPC) programming, covering code generation, parallelization, frameworks, evaluation, and broader challenges. It finds that general‑purpose LLMs perform adequately on serial and OpenMP‑style tasks but struggle with distributed MPI workloads, while domain‑specialized models achieve higher accuracy yet are limited in scope and evaluation. The authors argue that LLMs will not replace HPC experts soon but can act as powerful collaborators, provided richer datasets, integration with performance tools, rigorous evaluation, and governance are developed.
By Strahinja Ljaljevic, Josep Jorba, Sergio Iserte
The paper introduces Successive Capacity Growth (SCG), a method for adaptively expanding Vision Transformer encoders in Joint-Embedding Predictive Architectures (JEPAs). SCG starts with a minimal encoder and incrementally increases width or depth based on a task‑agnostic test‑and‑verify mechanism, while a Sketched Isotropic Gaussian Regularizer (SIGReg) keeps learned semantic dimensions independent. Experiments on multi‑object dynamics and 2D navigation tasks show that SCG achieves up to 20.3% better prediction loss than fixed small baselines and 23% better than fixed large models, with far greater parameter efficiency and no false‑positive expansions.
By Frederik Berenz
The paper introduces Composed Gait Retrieval (CoGR), a task that retrieves a target gait sequence using a reference sequence and a natural language modification query. To support this, the authors create the first gait-language datasets—Language‑Augmented CCPG and Language‑Augmented CASIA‑B—via an automated annotation pipeline powered by large vision‑language models. They propose ComposeGait, an identity‑anchored composition framework with a Part‑aware Identity Adapter that injects identity tokens into a shared Q‑Former, achieving state‑of‑the‑art retrieval performance on both benchmarks.
By Jingchen Fei, Zengbin Wang, Yukun Liu, Muyi Sun, Shibiao Xu, Man Zhang
The study compares an English-only and a bilingual decoder-only model, each 310 M parameters, trained on eight diverse languages while controlling for English exposure, compute, and document overlap. After aligning on shared English vocabulary, the authors find that token embeddings appear similar, but the deeper hidden states used for prediction diverge across models. This hidden‑state mismatch grows through middle transformer layers and persists despite controls, indicating that contextual processing differs between the models.
"whyItMatters":"The findings show that embedding alignment can conceal significant internal representation differences, which is crucial for any downstream work that assumes aligned multilingual models are interchangeable."
By Anjishnu Mukherjee, Ziwei Zhu, Antonios Anastasopoulos
The paper introduces BIND, a framework that binds a human’s biometric data to an AI agent’s identity and task-specific authority, enabling secure, real‑time delegation of control. By generating a token that an AI agent presents to an Identity Auditor, the system performs biometric authentication and recovers the agent’s ID and scope, providing non‑repudiable proof of human oversight. A practical implementation using face features and a fuzzy commitment scheme with turbo error‑correcting codes achieves a 96% true match rate at zero false match rate and supports 1024‑bit agent tokens.
By Joseph Geo Benjamin, Anil K Jain, Karthik Nandakumar
The paper introduces KBevo, a co‑evolving framework that simultaneously builds a structured knowledge base and performs reasoning over it for knowledge‑intensive question answering. By optimizing both components end‑to‑end with QA outcome rewards, the system improves the quality and connectivity of the knowledge base, leading to higher answer reachability and better compositional factual reasoning. Compared to standard retrieval baselines, KBevo offers greater controllability and improved factual accuracy.
By Ryan Thomas Noonan, Linxi Zhao, Menghan Xu, Akanksha Sarkar, Mihir Mishra, Dongyoung Go, Kilian Q. Weinberger, Yoav Artzi, Jennifer J. Sun
The paper introduces "complexity induction," a method that distorts training data in a structured way to promote compositional generalization in a standard CNN without changing its architecture. Using synthetic images of colored geometric shapes, the authors encode classes as flat string labels (e.g., "red‑circle") and deliberately omit certain color‑shape combinations from training. Two distortion techniques—mixed labels (soft target distributions based on Jaccard similarity) and expanded dataset (false samples with incorrect labels)—both enable the model to predict unseen class combinations, with mixed labels leveraging the CNN’s embedding structure and expanded training improving embedding factorization. A control experiment with random false labels shows that the effect relies on the structured nature of the distortion rather than noise alone.
By Aleksandr V. Abramov
The paper introduces SymbolLKG, a neuro-symbolic framework that combines a Logical Knowledge Graph (LKG) with dynamic solver routing to improve logical reasoning in large language models. The LKG represents logical rules and constraints as topological nodes, enabling explicit modeling of dependencies extracted from text. A Logic Router dispatches tasks to the most suitable symbolic engine, supported by a topology-aware hybrid retrieval mechanism, and the approach outperforms existing prompting and RAG baselines on logical reasoning benchmarks.
By Haizhao Fan, Yuchi Xiong, Jize Wang, Xinping Guan, Xinyi Le
The paper introduces FairGIN, a fairness-aware graph neural network designed to predict demand for expanding bike‑sharing systems while addressing cold‑start challenges and equity concerns. It combines expansion‑simulated incremental training, attention‑based knowledge transfer, and income‑stratified regularization to improve predictive accuracy and reduce income‑based disparities. Experiments on NYC and Seattle show that FairGIN outperforms existing methods and supports more inclusive station placement without sacrificing overall efficiency.
By Man Luo, Yixuan Zhao
The paper introduces Omni-Interactive Universal Embedder (OmniUE), a unified embedding framework that learns a single representation space for text, video, and audio using learnable tokens and intermediate-layer representations. OmniUE supports omni-interactive querying, allowing users to input text, visual regions, or audio spans, which are processed by segmenters and an omni-LLM to generate user-conditioned embeddings. The authors evaluate OmniUE on the new OmniCHOIR benchmark and other multimodal tasks, reporting significant performance gains over state‑of‑the‑art baselines across textual, audio, and visual interactive settings.
By Wei-Yao Wang, Kazuya Tateishi, Shuyang Cui, Christian Simon, Takashi Shibuya, Shusuke Takahashi, Yuki Mitsufuji
The paper presents a Causal Graph‑Informed Temporal Convolutional Network (CG‑TCN) that fuses a learned causal graph with a temporal convolutional network to forecast retail electricity prices. By decomposing price series into multi‑resolution trends and discovering a causal graph over these components and key covariates, the model conditions its convolutions and attention on causal pathways. On ten years of Ohio residential contracts, CG‑TCN outperforms benchmarks, achieving MAEps of 3.08%, 3.82%, and 5.43% for one‑, ten‑, and fifteen‑step‑ahead forecasts, respectively.
By Yufan Ji, Abdollah Shafieezadeh, Noah Dormady
The paper presents a scalable graph neural network (GNN) system for friend recommendation on a massive social graph. It introduces two key design choices: multi-hash ID embeddings that shrink the embedding table by over 98% without hurting ranking quality, and a timestamp-sorted compressed sparse row (CSR) storage with binary search that reduces temporal neighbor sampling from linear to logarithmic time. Experiments on a 194‑million‑user, 28‑billion‑edge graph show that these techniques enable production‑grade performance, boosting friend additions by 16% and unique friend adders by 11.5% in an online A/B test.
By Maksim Utushkin, Andrei Ovsiannikov, Alexander D'yakonov