Searcharxiv⌕ Search

arXiv subjects

Gaia Carenini

Publications and source records attributed to Gaia Carenini.

22 records · Page 2Linked to original sources

Sparse logistic regression for RR Lyrae vs binaries classification

RR Lyrae (RRL) are old, low-mass radially pulsating variable stars in their core helium burning phase. They are popular stellar tracers and primary distance indicators, since they obey to well defined period-luminosity relations in the near-infrared regime. Their photometric identification is not trivial, indeed, RRL samples can be contaminated by eclipsing binaries, especially in large datasets produced by fully automatic pipelines. Interpretable machine-learning approaches for separating eclipsing binaries from RRL are thus needed. Ideally, they should be able to achieve high precision in identifying RRL while generalizing to new data from different instruments. In this paper, we train a simple logistic regression classifier on Catalina Sky Survey (CSS) light curves. It achieves a precision of 87% at 78% recall for the RRL class on unseen CSS light curves. It generalizes on out-of-sample data (ASAS/ASAS-SN light curves) with a precision of 85% at 96% recall. We also considered a L1-regularized version of our classifier, which reaches 90% sparsity in the light-curve features with a limited trade-off in accuracy on our CSS validation set and -- remarkably -- also on the ASAS/ASAS-SN light curve test set. Logistic regression is natively interpretable, and regularization allows us to point out the parts of the light curves that matter the most in classification. We thus achieved both good generalization and full interpretability.

astro-ph.SR↗

Adversarial Path Planning for Optimal Camera Positioning

The use of visual sensors is flourishing, driven among others by the several applications in detection and prevention of crimes or dangerous events. While the problem of optimal camera placement for total coverage has been solved for a decade or so, that of the arrangement of cameras maximizing the recognition of objects "in-transit" is still open. The objective of this paper is to attack this problem by providing an adversarial method of proven optimality based on the resolution of Hamilton-Jacobi equations. The problem is attacked by first assuming the perspective of an adversary, i.e. computing explicitly the path minimizing the probability of detection and the quality of reconstruction. Building on this result, we introduce an optimality measure for camera configurations and perform a simulated annealing algorithm to find the optimal camera placement.

cs.CG↗

Federated Learning Aggregation: New Robust Algorithms with Guarantees

Federated Learning has been recently proposed for distributed model training at the edge. The principle of this approach is to aggregate models learned on distributed clients to obtain a new more general "average" model (FedAvg). The resulting model is then redistributed to clients for further training. To date, the most popular federated learning algorithm uses coordinate-wise averaging of the model parameters for aggregation. In this paper, we carry out a complete general mathematical convergence analysis to evaluate aggregation strategies in a federated learning framework. From this, we derive novel aggregation algorithms which are able to modify their model architecture by differentiating client contributions according to the value of their losses. Moreover, we go beyond the assumptions introduced in theory, by evaluating the performance of these strategies and by comparing them with the one of FedAvg in classification tasks in both the IID and the Non-IID framework without additional hypothesis.

stat.ML↗

FedControl: When Control Theory Meets Federated Learning

To date, the most popular federated learning algorithms use coordinate-wise averaging of the model parameters. We depart from this approach by differentiating client contributions according to the performance of local learning and its evolution. The technique is inspired from control theory and its classification performance is evaluated extensively in IID framework and compared with FedAvg.

cs.LG↗