Related papers: Joint Screening Tests for LASSO
Few-Shot Object Detection (FSOD) is a rapidly growing field in computer vision. It consists in finding all occurrences of a given set of classes with only a few annotated examples for each class. Numerous methods have been proposed to…
We assess proposals for entangling two distant atoms by measurement of emitted photons, analyzing how their performance depends on the photon detection efficiency. We consider schemes based on measurement of one or two photons and compare…
In this work we develop an experimental procedure to interrogate the single- and multiphoton scattering matrices of an unknown quantum system interacting with propagating photons. Our proposal requires coherent state laser or microwave…
Multiple Object Tracking (MOT) has rapidly progressed in recent years. Existing works tend to design a single tracking algorithm to perform both detection and association. Though ensemble learning has been exploited in many tasks, i.e,…
Scientists often use a paired comparison of the areas under the receiver operating characteristic curves to decide which continuous cancer screening test has the best diagnostic accuracy. In the paired design, all participants are screened…
The seriation problem seeks to reorder a set of elements given pairwise similarity information, so that elements with higher similarity are closer in the resulting sequence. When a global ordering consistent with the similarity information…
Quantum tomography approaches typically consider a set of observables which we wish to measure, design a measurement scheme which measures each of the observables and then repeats the measurements as many times as necessary. We show that…
We use an optical cavity to detect single atoms magnetically trapped on an atom chip. We implement the detection using both fluorescence into the cavity and reduction in cavity transmission due to the presence of atoms. In fluorescence, we…
Second generation sequencing technologies are being increasingly used for genetic association studies, where the main research interest is to identify sets of genetic variants that contribute to various phenotype. The phenotype can be…
Neutral-atom arrays are a leading platform for quantum technologies, offering a promising route toward large-scale, fault-tolerant quantum computing. We propose a novel quantum processing architecture based on dual-type, dual-element atom…
We report the cooling of an atomic ensemble with light, where each atom scatters only a single photon on average. This is a general method that does not require a cycling transition and can be applied to atoms or molecules which are…
Estimation of quantum states and measurements is crucial for the implementation of quantum information protocols. The standard method for each is quantum tomography. However, quantum tomography suffers from systematic errors caused by…
The atomic lensing model has been proposed as a promising method facilitating atom-counting in heterogeneous nanocrystals [KHW van den Bos et. al, Phys. Rev. Lett. 116 (2016) 246101] Here, image simulations will validate the model, which…
The problems of Lasso regression and optimal design of experiments share a critical property: their optimal solutions are typically \emph{sparse}, i.e., only a small fraction of the optimal variables are non-zero. Therefore, the…
We fabricate a miniature spherical mirror for tightly focusing an optical dipole trap for neutral atoms. The mirror formation process is modelled to predict the dimensions for particular fabrication parameters. We integrate the spherical…
We trap a single cesium atom in a standing-wave optical dipole trap. Special experimental procedures, designed to work with single atoms, are used to measure the oscillation frequency and the atomic energy distribution in the dipole trap.…
In variable or graph selection problems, finding a right-sized model or controlling the number of false positives is notoriously difficult. Recently, a meta-algorithm called Stability Selection was proposed that can provide reliable…
Screening is the problem of finding a superset of the set of non-zero entries in an unknown p-dimensional vector \beta* given n noisy observations. Naturally, we want this superset to be as small as possible. We propose a novel framework…
Most known results on avoiding the occur-check are based on the notion of "not subject to occur-check" (NSTO). It means that unification is performed only on such pairs of atoms for which the occur-check never succeeds in any run of a…
In this paper, we consider lasso problems with zero-sum constraint, commonly required for the analysis of compositional data in high-dimensional spaces. A novel algorithm is proposed to solve these problems, combining a tailored active-set…