Related papers: Segmented-Polynomial-fitting Least Squares (SPLS):…
We present a new method to detect planetary transits from time-series photometry, the Transit Least Squares (TLS) algorithm. TLS searches for transit-like features while taking the stellar limb darkening and planetary ingress and egress…
We present a new implementation of the commonly used Box-fitting Least Squares (BLS) algorithm, for the detection of transiting exoplanets in photometric data. Unlike BLS, our new implementation - Sparse BLS (SBLS), does not use binning of…
The sensitivities of two periodograms are compared for weak signal planet detection in transit surveys: the widely used Box-Least Squares (BLS) algorithm following light curve detrending and the Transit Comb Filter (TCF) algorithm following…
We apply, for the first time, the Transit Least Squares (TLS) algorithm to search for new transiting exoplanets. TLS is a successor to the Box Least Squares (BLS) algorithm, which has served as a standard tool for the detection of periodic…
Partial least squares, as a dimension reduction method, has become increasingly important for its ability to deal with problems with a large number of variables. Since noisy variables may weaken the performance of the model, the sparse…
Partial Least Squares (PLS) is a widely used method for data integration, designed to extract latent components shared across paired high-dimensional datasets. Despite decades of practical success, a precise theoretical understanding of its…
The Large Synoptic Survey Telescope (LSST) will photometrically monitor approximately 1 billion stars for ten years. The resulting light curves can be used to detect transiting exoplanets. In particular, as demonstrated by Lund et al.…
We present DEtection in phase-folded Light curves with cOntrastive Scoring (DELOS), a contrastive-learning-based framework designed to search for shallow transits in Kepler photometry. DELOS combines GPU-accelerated phase folding, optimized…
The Broad Learning System (BLS) has gained significant attention for its computational efficiency and less network parameters compared to deep learning structures. However, the standard BLS relies on the pseudoinverse solution, which…
We address the phase retrieval problem with errors in the sensing vectors. A number of recent methods for phase retrieval are based on least squares (LS) formulations which assume errors in the quadratic measurements. We extend this…
Relating a set of variables X to a response y is crucial in chemometrics. A quantitative prediction objective can be enriched by qualitative data interpretation, for instance by locating the most influential features. When high-dimensional…
With a rapid increase in volume and complexity of data sets, there is a need for methods that can extract useful information, for example the relationship between two data sets measured for the same persons. The Partial Least Squares (PLS)…
In this work, we present a subdomain discontinuous least-squares (SDLS) scheme for neutronics problems. Least-squares (LS) methods are known to be inaccurate for problems with sharp total-cross section interfaces. In addition, the…
Sparse Partial Least Squares (sPLS) is a common dimensionality reduction technique for data fusion, which projects data samples from two views by seeking linear combinations with a small number of variables with the maximum variance.…
High-contrast imaging of exoplanets hinges on powerful post-processing methods to denoise the data and separate the signal of a companion from its host star, which is typically orders of magnitude brighter. Existing post-processing…
We carry out a comparative analysis of the performance of three algorithms widely used to identify significant periodicities in radial-velocity (RV) datasets: the Generalised Lomb-Scargle Periodogram (GLS), its modified version based on…
Context: Transit surveys, both ground- and space- based, have already accumulated a large number of light curves that span several years. Aims: The search for transiting planets in these long time series is computationally intensive. We…
We present a non-conforming least squares method for approximating solutions of second order elliptic problems with discontinuous coefficients. The method is based on a general Saddle Point Least Squares (SPLS) method introduced in previous…
Solving an integer least squares (ILS) problem usually consists of two stages: reduction and search. This thesis is concerned with the reduction process for the ordinary ILS problem and the ellipsoid-constrained ILS problem. For the…
Partial Least Squares (PLS) methods have been heavily exploited to analyse the association between two blocs of data. These powerful approaches can be applied to data sets where the number of variables is greater than the number of…