Related papers: On the Reduction and Evaluation of Generalized Pol…

In this talk I review the connections between Feynman integrals and multiple polylogarithms. After an introductory section on loop integrals I discuss the Mellin-Barnes transformation and shuffle algebras. In a subsequent section multiple…

Machine learning potentials (MLPs) developed from extensive datasets constructed from density functional theory (DFT) calculations have become increasingly appealing for many researchers. This paper presents a framework of polynomial-based…

We extend the assertion of the Generalized Lower Bound Theorem (GLBT) to general polytopes under the assumption that their low dimensional skeleton is simplicial, with partial results for the general case. We prove a quantitative version of…

This paper presents new methods for analyzing and evaluating generalized plans that can solve broad classes of related planning problems. Although synthesis and learning of generalized plans has been a longstanding goal in AI, it remains…

This work presents a generalized notion of multiset mapping thus resolving a long standing obstacle in structural study of multiset processing. It has been shown that the mapping defined herein can model a vast array of notions as special…

We discuss the simplified likelihood framework as a systematic approximation scheme for experimental likelihoods such as those originating from LHC experiments. We develop the simplified likelihood from the Central Limit Theorem keeping the…

We propose a generalized formulation of the Huber loss. We show that with a suitable function of choice, specifically the log-exp transform; we can achieve a loss function which combines the desirable properties of both the absolute and the…

Motivated by the Cheung's elaborate work [Linear Multilinear Algebra, 51 (2003), 299-310], we investigate the construction of a Lie derivation on a generalized matrix algebra and apply it to give a characterization for such a Lie derivation…

We generalize the hyper-systolic algorithm proposed in [1] for abstract data structures on massive parallel computers with $n_p$ processors. For a problem of size $V$ the communication complexity of the hyper-systolic algorithm is…

Hyperparameter tuning is an important task of machine learning, which can be formulated as a bilevel program (BLP). However, most existing algorithms are not applicable for BLP with non-smooth lower-level problems. To address this, we…

Large Language Models (LLMs) have been achieving competent performance on a wide range of downstream tasks, yet existing work shows that inference on structured data is challenging for LLMs. This is because LLMs need to either understand…

The purpose of this note is to extend the divergences analyzed in a previous work by application of the Deformed Logarithm in its most general form. In a study on entropic divergences, we have analyzed the different forms of the deformed…

The Zwanzig-Mori pro jection formalism is widely used in studying systems with many degrees of freedom. Recently Xing and Kim used the pro jection formalism and derived the generalized Langevin equations (GLEs) for a general stochastic…

Graphical models with High Order Potentials (HOPs) have received considerable interest in recent years. While there are a variety of approaches to inference in these models, nearly all of them amount to solving a linear program (LP)…

This article has been withdrawn because it has been merged with the earlier article GCT3 (arXiv: CS/0501076 [cs.CC]) in the series. The merged article is now available as: Geometric Complexity Theory III: on deciding nonvanishing of a…

We first present a filtration on the ring L of Laurent polynomials such that the direct sum decomposition of its associated graded ring gr L agrees with the direct sum decomposition of gr L, as a module over the complex general linear Lie…

Fine-tuning (FT) large language models (LLMs) is crucial for adapting general-purpose models to specific tasks, enhancing accuracy and relevance with minimal resources. To further enhance generalization ability while reducing training…

The article is devoted to introduce and investigation of new numeral systems. These representations are generalizations of classical representations of real numbers. The main properties of investigating representations are described. The…

This paper presents a summary of the first Workshop on Building Linguistically Generalizable Natural Language Processing Systems, and the associated Build It Break It, The Language Edition shared task. The goal of this workshop was to bring…

The aim of this paper is to introduce the degenerate generalized Laguerre polynomials as the degenerate version of the generalized Laguerre polynomials and to derive some properties related to those polynomials and Lah numbers, including an…