Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

306089119 · Jun 202019922001200920172026
48 results for electroweak interaction

Develops equivariant connections for Yang-Mills equations, simplifying interactions modeling.

problem Simplifying interactions modeling in Yang-Mills equations for different bundles.
method Introduces SO+(p,q)SO^+(p,q)-equivariance to reduce Yang-Mills equations.
result Models electroweak interaction and interactions with differential and wave equations.

It is shown that in the semi-classical approximation of the electroweak sector of the Standard Model the moduli space of vacua can be identified with the first de Rham cohomology group of space-time. This gives a slightly different physical interpretation of the occurrence of the well-known Ahoronov-Bohm effect. Moreov…

2003-10-17abs ↗pdf ↗

Unified field theory from higher-order Riemannian geometry.

problem Field-theoretical unification of fundamental forces.
method Exploiting higher-order Riemannian geometry and Einstein-Hilbert action, deriving gauge theories and predicting physical constants.
result Theoretical predictions for Weinberg angle and Coulomb's constant match experimental values.

The model integrates Standard Model bosons into a higher-dimensional spacetime.

problem Integrating Standard Model bosons into a higher-dimensional spacetime.
method Considered a spacetime of the form P=M4imesKP = M_4 imes K with K=SU(3)K = \mathrm{SU}(3), integrating the Einstein-Hilbert Lagrangian density over KK.
result Encodes not only Yang-Mills terms but also a kinetic term for the Higgs field and potential for gauge bosons.

In this paper we discuss the mechanism of spontaneous symmetry breaking from the point view of vacuum pairs, considered as ground states of a Yang-Mills-Higgs gauge theory. We treat a vacuum as a section in an appropriate bundle that is naturally associated with a minimum of a (general) Higgs potential. Such a vacuum s…

2002-11-05abs ↗pdf ↗

Factorization Machine (FM) is a widely used supervised learning approach by effectively modeling of feature interactions. Despite the successful application of FM and its many deep learning variants, treating every feature interaction fairly may degrade the performance. For example, the interactions of a useless featur…

2019-02-26abs ↗pdf ↗

A new method detects interactions in neural networks using topological analysis.

problem Detecting interactions between input features in neural networks.
method Topological analysis of neural network connectivity to quantify interaction strength.
result The PID algorithm outperforms state-of-the-art baselines in interaction detection tasks.

iKF method uncovers complex variable interactions for scientific discovery.

problem Limited interpretability of existing models in decision-making applications.
method Iterative Kings' Forests (iKF) method to uncover multi-order interactions.
result iKF provides strong interpretive power for explainable modeling.

A graph neural network detects beneficial feature interactions for recommender systems.

problem Feature interactions are crucial but not all are beneficial for recommendation accuracy.
method Graph neural network with L0 activation regularization for edge prediction.
result The model outperforms baselines and automatically identifies beneficial feature interactions.

We describe and extract time-ordered multibody interactions from complex systems.

problem Complex systems with temporal and multibody dependencies.
method Decompose multivariate Markov chains into time-ordered multibody interactions. Algorithm to extract interactions from data. Measure complexity of interaction ensembles.
result Robust and efficient algorithm to infer time-ordered multibody interactions from data.

Dropout regularizes against high-order interactions by canceling interaction rates.

problem Overfitting to high-order interactions in neural networks.
method Analyzes Dropout through the lens of interaction effects, showing how it effectively cancels out the probability of surviving interactions of different orders.
result Dropout regularizes against high-order interactions by effectively canceling out the probability of surviving interactions of different orders.

Understanding how features interact with each other is of paramount importance in many scientific discoveries and contemporary applications. Yet interaction identification becomes challenging even for a moderate number of covariates. In this paper, we suggest an efficient and flexible procedure, called the interaction …

2016-05-28abs ↗pdf ↗

Multitask Gaussian process (MTGP) is powerful for joint learning of multiple tasks with complicated correlation patterns. However, due to the assembling of additive independent latent functions, all current MTGPs including the salient linear model of coregionalization (LMC) and convolution frameworks cannot effectively…

2018-08-03abs ↗pdf ↗

SocialInteractionGAN generates realistic human interactions from low-dimensional data.

problem Generating realistic human interactions from limited data.
method Adversarial architecture with a recurrent encoder-decoder generator and dual-stream discriminator.
result SocialInteractionGAN produces high-quality action sequences of interacting people.

A new method detects interactions in machine learning models.

problem Interpreting non-linear and interaction effects in machine learning models.
method Regional effect plots with implicit interaction detection.
result The method quantifies and interprets feature effects reliably, less confounded by interactions.

xDeepInt learns both vector-wise and bit-wise feature interactions.

problem Learning feature interactions for CTR prediction and recommendation.
method Polynomial Interaction Network (PIN) architecture with subspace-crossing mechanism.
result xDeepInt outperforms state-of-the-art models in CTR prediction and recommendation.

This study explores how feature graphs enhance GNNs' performance in modeling interactions.

problem Improving GNNs' ability to model feature interactions effectively.
method Investigates feature graphs and their importance in GNNs, using experiments and theoretical support.
result Edges between interacting features are crucial for GNNs, while non-interaction edges can degrade performance.

Interpreting neural networks is a crucial and challenging task in machine learning. In this paper, we develop a novel framework for detecting statistical interactions captured by a feedforward multilayer neural network by directly interpreting its learned weights. Depending on the desired interactions, our method can a…

2017-05-14abs ↗pdf ↗

We introduce interactive structure discovery, a generic framework that encompasses many interactive learning settings, including active learning, top-k item identification, interactive drug discovery, and others. We adapt a recently developed active learning algorithm of Tosh and Dasgupta (2017) for interactive structu…

2019-06-05abs ↗pdf ↗

This paper uses Gaussian mixtures to mimic interactions in large language models.

problem Simulating interactions in large language models (LLMs) is computationally expensive.
method Developed an interacting Gaussian mixture model (GMM) system to mimic LLM interactions.
result The interacting Gaussian mixture model system can generate, exchange, and update data and parameters efficiently.

Study reveals self-attention's role in learning and generalizing interactions.

problem Understanding self-attention's theoretical role in neural architectures.
method Interacting entities analysis, including multi-agent RL and genetic sequences.
result Self-attention efficiently represents, learns, and generalizes pairwise interactions.

Archipelago provides interpretable explanations of feature interactions in machine learning models.

problem Interpreting the impact of feature interactions on predictions in machine learning models.
method Archipelago is a novel framework for extracting and attributing feature interactions in a scalable and interpretable manner.
result Archipelago provides significantly more interpretable explanations of feature interactions than comparable methods.

Automated tests detect interactions in unstructured data.

problem Detecting interactions between latent variables in low-dimensional systems.
method Derive two interaction tests based on pairwise interventions and integrate them into an active learning pipeline.
result Tests can identify more known biological interactions than random search and standard active learning baselines.

We study the power of interactivity in local differential privacy. First, we focus on the difference between fully interactive and sequentially interactive protocols. Sequentially interactive protocols may query users adaptively in sequence, but they cannot return to previously queried users. The vast majority of exist…

2019-04-07abs ↗pdf ↗

PIN models feature interactions using a neural network that mimics decision trees.

problem Modeling feature interactions in tabular data for predictive modeling.
method Tree-like Pairwise Interaction Network (PIN) architecture that captures pairwise feature interactions through a shared feed-forward neural network.
result PIN outperforms traditional and modern neural networks benchmarks in predictive accuracy.

The paper explains DNNs by quantifying interactions among input variables.

problem Understanding and explaining the complex behavior of deep neural networks.
method The paper defines and quantifies the significance of interactions among multiple input variables using the Shapley value.
result The proposed method effectively explains the behavior of DNNs by assigning attribution values to input variables.

MEI model improves knowledge graph completion by efficiently modeling interactions between embeddings.

problem Efficiently modeling interactions between knowledge graph embeddings to predict missing links.
method MEI divides embeddings into partitions and uses Tucker and block term formats to model interactions efficiently.
result Achieves state-of-the-art performance on link prediction tasks.

Perfect clustering achieved in hypergraphs with enough interactions.

problem Complexity and lack of tractable models for analyzing hypergraphs.
method Introduced an interaction hypergraph model for analyzing hypergraphs, defined latent embeddings, and analyzed spectral estimators.
result A spectral estimate of interaction latent positions can achieve perfect clustering with enough interactions.

SurvFD and SurvSHAP-IQ provide interpretable survival models by analyzing feature interactions.

problem Non-additivity of hazard and survival functions limits standard additive explanation methods.
method SurvFD decomposes higher-order effects into time-dependent and time-independent components, extending Shapley interactions to time-indexed functions.
result SurvFD and SurvSHAP-IQ offer a new perspective on survival explanations, explicitly characterizing feature interactions.

Interactions such as double negation in sentences and scene interactions in images are common forms of complex dependencies captured by state-of-the-art machine learning models. We propose Mahé, a novel approach to provide Model-agnostic hierarchical éxplanations of how powerful machine learning models, such as deep ne…

2018-12-12abs ↗pdf ↗

Coercivity condition ensures learning of interacting particle systems.

problem Ensuring identifiability of interaction functions in learning systems of interacting particles.
method Equivalence of coercivity condition to strictly positive definiteness of an integral kernel.
result For ergodic systems, the integral kernel is strictly positive definite, satisfying the coercivity condition.

We present an approach for building an active agent that learns to segment its visual observations into individual objects by interacting with its environment in a completely self-supervised manner. The agent uses its current segmentation model to infer pixels that constitute objects and refines the segmentation model …

2018-06-21abs ↗pdf ↗

Gaussian process framework learns interaction kernels in multi-species particle systems.

problem Learning interaction kernels in multi-species interacting particle systems from trajectory data.
method Nonparametric Bayesian approach with Gaussian processes.
result Established rigorous statistical guarantees for recoverability and optimality of interaction kernels.

Estimating global pairwise interaction effects, i.e., the difference between the joint effect and the sum of marginal effects of two input features, with uncertainty properly quantified, is centrally important in science applications. We propose a non-parametric probabilistic method for detecting interaction effects of…

2019-01-24abs ↗pdf ↗