Related papers: Discoveries far from the Lamppost with Matrix Elem…
Object placement aims to determine the appropriate placement (\emph{e.g.}, location and size) of a foreground object when placing it on the background image. Most previous works are limited by small-scale labeled dataset, which hinders the…
Frequently, multiple entities (methods, algorithms, procedures, solutions, etc.) can be developed for a common task and applied across various domains that differ in the distribution of scenarios encountered. For example, in computer…
We propose a novel method for analysis of experimental data obtained at relativistic nucleus-nucleus collisions. The method, based on the ideas of Random Matrix Theory, is applied to detect systematic errors that occur at measurements of…
The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated reassemblage of finite element matrices for nonlinear PDEs is…
This paper explores a top-down approach to automating incremental advances in machine learning research through component-level innovation, facilitated by Large Language Models (LLMs). Our framework systematically generates novel…
The Large Hadron Collider (LHC) is sensitive to signals of beyond the Standard Model physics through a variety of channels including missing energy and resonance searches. In most searches, the new physics and the Standard Model backgrounds…
Classical latent-score ranking models often fail to distinguish objects' intrinsic scores from contextual effects, which are typically nonlinear and can dominate the observed outcomes. To address this, we introduce a semiparametric ranking…
We study the asymptotic rank of adjacency matrices of a large class of edge-weighted configuration models. Here, the weight of a (multi-)edge can be any fixed non-zero element from an arbitrary field, as long as it is independent of the…
An event-based maximum likelihood method for handling X-ray polarimetry data is extended to include the effects of background and nonuniform sampling of the possible position angle space. While nonuniform sampling in position angle space…
The latent position network model (LPM) is a popular approach for the statistical analysis of network data. A central aspect of this model is that it assigns nodes to random positions in a latent space, such that the probability of an…
Contrary to the general trend of looking for new physics at energies beyond the current reach of the Large Hadron Collider (LHC), this article proposes a strategy to look for light new physics via a meticulous study of well known and…
We here introduce a novel classification approach adopted from the nonlinear model identification framework, which jointly addresses the feature selection and classifier design tasks. The classifier is constructed as a polynomial expansion…
The operating status of power systems is influenced by growing varieties of factors, resulting from the developing sizes and complexity of power systems; in this situation, the modelbased methods need be revisited. A data-driven method, as…
Matrix inversion problems are often encountered in experimental physics, and in particular in high-energy particle physics, under the name of unfolding. The true spectrum of a physical quantity is deformed by the presence of a detector,…
This document summarises the proposal of the LHC Dark Matter Working Group on how to present LHC results on $s$-channel simplified dark matter models and to compare them to direct (indirect) detection experiments.
We advocate a new approach to study models of fermion masses and mixings, namely anarchy proposed in hep-ph/9911341. In this approach, we scan the O(1) coefficients randomly. We argue that this is the correct approach when the fundamental…
We determine the rank of a random matrix A over a finite field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes. This formula verifies a…
Low-rank Matrix Completion (LRMC) describes the problem where we wish to recover missing entries of partially observed low-rank matrix. Most existing matrix completion work deals with sampling procedures that are independent of the…
We introduce a novel framework of ranking with abstention, where the learner can abstain from making prediction at some limited cost $c$. We present a extensive theoretical analysis of this framework including a series of $H$-consistency…
A model independent method to search for particles of unknown masses in events with missing energy is presented. The only assumption is the topology of the decay chain. The method is tested in events with top pairs decaying leptonically…