Pasar al contenido principal

PROCESADO DE DATOS UNIFICADO MEDIANTE TRANSFORMACIONES PROBABILISTICAS

PID2019-105058GA-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2019
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario ASOC BCAM - BASQUE CENTER FOR APPLIED MATHEMATICS

Resultados relacionados

Resultados totales (Incluyendo duplicados): 13
Encontrada(s) 1 página(s)

BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Probabilistic Load Forecasting Based on Adaptive Online Learning

  • Álvarez, V.
  • Mazuelas, S.
  • Lozano, J.A.
Load forecasting is crucial for multiple energy management tasks such as scheduling generation capacity, planning supply and demand, and minimizing energy trade costs. Such relevance has increased even more in recent years due to the integration of renewable energies, electric cars, and microgrids. Conventional load forecasting techniques obtain singlevalue load forecasts by exploiting consumption patterns of past load demand. However, such techniques cannot assess intrinsic uncertainties in load demand, and cannot capture dynamic changes in consumption patterns. To address these problems, this paper presents a method for probabilistic load forecasting based on the adaptive online learning of hidden Markov models. We propose learning and forecasting techniques with theoretical guarantees, and experimentally assess their performance in multiple scenarios. In particular, we develop adaptive online learning techniques that update model parameters recursively, and sequential prediction techniques that obtain probabilistic forecasts using the most recent parameters. The performance of the method is evaluated using multiple datasets corresponding with regions that have different sizes and display assorted time-varying consumption patterns. The results show that the proposed method can significantly improve the performance of existing techniques for a wide range of scenarios., Ramon y Cajal Grant RYC-2016-19383 Basque Government under the grant "Artificial Intelligence in BCAM number EXP. 2019/00432" Iberdrola Foundation under the 2019 Research Grants
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Minimax Classification with 0-1 Loss and Performance Guarantees

  • Mazuelas, S.
  • Zanoni, A.
  • Pérez, A.
Supervised classification techniques use training samples to find classification rules with small expected 0-1 loss. Conventional methods achieve efficient learning and out-of-sample generalization by minimizing surrogate losses over specific families of rules. This paper presents minimax risk classifiers (MRCs) that do not rely on a choice of surrogate loss and family of rules. MRCs achieve efficient learning and out-of-sample generalization by minimizing worst-case expected 0-1 loss w.r.t. uncertainty sets that are defined by linear constraints and include the true underlying distribution. In addition, MRCs’ learning stage provides performance guarantees as lower and upper tight bounds for expected 0-1 loss. We also present MRCs’ finite-sample generalization bounds in terms of training size and smallest minimax risk, and show their competitive classification performance w.r.t. state-of-the-art techniques using benchmark datasets., Ramon y Cajal Grant RYC-2016-19383
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Deep GEM-based network for weakly supervised UWB ranging error mitigation

  • Li, Y
  • Mazuelas, S.
  • Shen, Y.
Ultra-wideband (UWB)-based techniques, while becoming mainstream approaches for high-accurate positioning, tend to be challenged by ranging bias in harsh environments. The emerging learning-based methods for error mitigation have shown great performance improvement via exploiting high semantic features from raw data. However, these methods rely heavily on fully labeled data, leading to a high cost for data acquisition. We present a learning framework based on weak supervision for UWB ranging error mitigation. Specifically, we propose a deep learning method based on the generalized expectation-maximization (GEM) algorithm for robust UWB ranging error mitigation under weak supervision. Such method integrate probabilistic modeling into the deep learning scheme, and adopt weakly supervised labels as prior information. Extensive experiments in various supervision scenarios illustrate the superiority of the proposed method., Ramon y Cajal Grant RYC-2016-19383
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

A Semi-Supervised Learning Approach for Ranging Error Mitigation Based on UWB Waveform

  • Li, Y.
  • Mazuelas, S.
  • Shen, Y.
Localization systems based on ultra-wide band (UWB) measurements can have unsatisfactory performance in harsh environments due to the presence of non-line-of-sight (NLOS) errors. Learning-based methods for error mitigation have shown great performance improvement via directly exploiting the wideband waveform instead of handcrafted features. However, these methods require data samples fully labeled with actual measurement errors for training, which leads to time consuming data collection. In this paper, we propose a semisupervised learning method based on variational Bayes for UWB ranging error mitigation. Combining deep learning techniques and statistic tools, our method can efficiently accumulate knowledge from both labeled and unlabeled data samples. Extensive experiments illustrate the effectiveness of the proposed method under different supervision rates, and the superiority compared to other fully supervised methods even at a low supervision rate., Ramon y Cajal Grant RYC-2016-19383
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Generalized Maximum Entropy for Supervised Classification

  • Mazuelas, S.
  • Shen, Y.
  • Pérez, A.
The maximum entropy principle advocates to evaluate events’ probabilities using a distribution that maximizes entropy among those that satisfy certain expectations’ constraints. Such principle can be generalized for arbitrary decision problems where it corresponds to minimax approaches. This paper establishes a framework for supervised classification based on the generalized maximum entropy principle that leads to minimax risk classifiers (MRCs). We develop learning techniques that determine MRCs for general entropy functions and provide performance guarantees by means of convex optimization. In addition, we describe the relationship of the presented techniques with existing classification methods, and quantify MRCs performance in comparison with the proposed bounds and conventional methods., RYC-2016-19383
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

A Deep Learning Approach for Generating Soft Range Information from RF Data

  • li, Y.
  • Mazuelas, S.
  • Shen, Y.
Radio frequency (RF)-based techniques are widely adopted for indoor localization despite the challenges in extracting sufficient information from measurements. Soft range information (SRI) offers a promising alternative for highly accurate localization that gives all probable range values rather than a single estimate of distance. We propose a deep learning approach to generate accurate SRI from RF measurements. In particular, the proposed approach is implemented by a network with two neural modules and conducts the generation directly from raw data. Extensive experiments on a case study with two public datasets are conducted to quantify the efficiency in different indoor localization tasks. The results show that the proposed approach can generate highly accurate SRI, and significantly outperforms conventional techniques in both nonline-of-sight (NLOS) detection and ranging error mitigation., Ramon y Cajal Grant RYC-2016-19383
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Deep Generative Model for Simultaneous Range Error Mitigation and Environment Identification

  • Li, X.
  • Mazuelas, S.
  • Shen, Y.
Received waveforms contain rich information for both range information and environment semantics. However, its full potential is hard to exploit under multipath and non-line- of-sight conditions. This paper proposes a deep generative model (DGM) for simultaneous range error mitigation and environment identification. In particular, we present a Bayesian model for the generative process of the received waveform composed by latent variables for both range-related features and environment semantics. The simultaneous range error mitigation and environment identification is interpreted as an inference problem based on the DGM, and implemented in a unique end-to-end learning scheme. Comprehensive experiments on a general Ultra-wideband dataset demonstrate the superior performance on range error mitigation, scalability to different environments, and novel capability on simultaneous environment identification., Ramon y Cajal Grant RYC-2016-19383
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Minimax Classification under Concept Drift with Multidimensional Adaptation and Performance Guarantees

  • Alvarez, V.
  • Mazuelas, S.
  • Lozano, J.A.
The statistical characteristics of instance-label pairs often change with time in practical scenarios of supervised classification. Conventional learning techniques adapt to such concept drift accounting for a scalar rate of change by means of a carefully chosen learning rate, forgetting factor, or window size. However, the time changes in common scenarios are multidimensional, i.e., different statistical characteristics often change in a different manner. This paper presents adaptive minimax risk classifiers (AMRCs) that account for multidimensional time changes by means of a multivariate and high-order tracking of the time-varying underlying distribution. In addition, differently from conventional techniques, AMRCs can provide computable tight performance guarantees. Experiments on multiple benchmark datasets show the classification improvement of AMRCs compared to the state-of-the-art and the reliability of the presented performance guarantees., Ramon y Cajal Grant RYC-2016-19383 BCAM’s Severo Ochoa Excellence Accreditation SEV-2017-0718, the Spanish Ministry of Economic Affairs and Digital Transformation through Project IA4TES MIA.2021.M04.0008, and by the Basque Government through the IT-1504-22, and BERC 2022-2025 programmes.
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

A Variational Learning Approach for Concurrent Distance Estimation and Environmental Identification

  • Li, Y
  • Mazuelas, S.
  • Shen, Y.
Wireless propagated signals encapsulate rich information for high-accuracy localization and environment sensing. However, the full exploitation of positional and environmental features as well as their correlation remains challenging in complex propagation environments. In this paper, we propose a methodology of variational inference over deep neural networks for concurrent distance estimation and environmental identification. The proposed approach, namely inter-instance variational auto-encoders (IIns-VAEs), conducts inference with latent variables that encapsulate information about both distance and environmental labels. A deep learning network with instance normalization is designed to approximate the inference concurrently via deep learning. We conduct extensive experiments on real-world datasets and the results show the superiority of the proposed IIns-VAE in both distance estimation and environmental identification compared to conventional approaches.
BIRD. BCAM's Institutional Repository Data
Publicación Tesis doctoral (DoctoralThesis)

Supervised Learning in Time-dependent Environments with Performance Guarantees

  • Álvarez, V.
In practical scenarios, it is common to learn from a sequence of related problems (tasks). Such tasks are usually time-dependent in the sense that consecutive tasks are often significantly more similar. Time-dependency is common in multiple applications such as load forecasting, spam main filtering, and face emotion recognition. For instance, in the problem of load forecasting, the consumption patterns in consecutive time periods are significantly more similar since human habits and weather factors change gradually over time. Learning from a sequence tasks holds promise to enable accurate performance even with few samples per task by leveraging information from different tasks. However, harnessing the benefits of learning from a sequence of tasks is challenging since tasks are characterized by different underlying distributions. Most existing techniques are designed for situations where the tasks’ similarities do not depend on their order in the sequence. Existing techniques designed for timedependent tasks adapt to changes between consecutive tasks accounting for a scalar rate of change by using a carefully chosen parameter such as a learning rate or a weight factor. However, the tasks’ changes are commonly multidimensional, i.e., the timedependency often varies across different statistical characteristics describing the tasks. For instance, in the problem of load forecasting, the statistical characteristics related to weather factors often change differently from those related to generation. In this dissertation, we establish methodologies for supervised learning from a sequence of time-dependent tasks that effectively exploit information from all tasks, provide multidimensional adaptation to tasks’ changes, and provide computable tight performance guarantees. We develop methods for supervised learning settings where tasks arrive over time including techniques for supervised classification under concept drift (SCD) and techniques for continual learning (CL). In addition, we present techniques for load forecasting that can adapt to time changes in consumption patterns and assess intrinsic uncertainties in load demand. The numerical results show that the proposed methodologies can significantly improve the performance of existing methods using multiple benchmark datasets. This dissertation makes theoretical contributions leading to efficient algorithms for multiple machine learning scenarios that provide computable performance guarantees and superior performance than state-of-the-art techniques.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Efficient Learning of Minimax Risk Classifiers in High Dimensions

  • Bondugula, K.R.
  • Mazuelas, S.
  • Pérez, A.
High-dimensional data is common in multiple areas, such as health care and genomics, where the number of features can be tens of thousands. In such scenarios, the large number of features often leads to inefficient learning. Constraint generation methods have recently enabled efficient learning of L1-regularized support vector machines (SVMs). In this paper, we leverage such methods to obtain an efficient learning algorithm for the recently proposed minimax risk classifiers (MRCs). The proposed iterative algorithm also provides a sequence of worst-case error probabilities and performs feature selection. Experiments on multiple high-dimensional datasets show that the proposed algorithm is efficient in high-dimensional scenarios. In addition, the worst-case error probability provides useful information about the classifier performance, and the features selected by the algorithm are competitive with the state-of-the-art., CNS2022-135203
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Double-Weighting for Covariate Shift Adaptation

  • Segovia, J.I
  • Mazuelas, S.
  • Liu, A.
Supervised learning is often affected by a covariate shift in which the marginal distributions of instances (covariates $x$) of training and testing samples $p_\text{tr}(x)$ and $p_\text{te}(x)$ are different but the label conditionals coincide. Existing approaches address such covariate shift by either using the ratio $p_\text{te}(x)/p_\text{tr}(x)$ to weight training samples (reweighted methods) or using the ratio $p_\text{tr}(x)/p_\text{te}(x)$ to weight testing samples (robust methods). However, the performance of such approaches can be poor under support mismatch or when the above ratios take large values. We propose a minimax risk classification (MRC) approach for covariate shift adaptation that avoids such limitations by weighting both training and testing samples. In addition, we develop effective techniques that obtain both sets of weights and generalize the conventional kernel mean matching method. We provide novel generalization bounds for our method that show a significant increase in the effective sample size compared with reweighted methods. The proposed method also achieves enhanced classification performance in both synthetic and empirical experiments., CNS2022-135203, “Early Prognosis of COVID-19 Infections via Machine Learning” funded by the AXA Research Fund
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Indoor Localization System With NLOS Mitigation Based on Self-Training

  • Huang, Y.
  • Mazuelas, S.
  • Ge, F.
  • Shen, Y.
Location-awareness has become a fundamental requirement for multiple emerging applications with the rapid development of wireless technologies. The high-accuracy ranging enabled by ultra-wide bandwidth (UWB) signals is often deteriorated by clocks imperfections and non-line-of-sight (NLOS) propagation. Existing supervised learning methods for NLOS identification and mitigation are time-consuming, labor-intensive, and cost-inefficient due to the need for training data acquisition and label assignment. This paper presents an indoor localization system that enables NLOS mitigation based on self-training. The system provides a general information fusion framework that integrates map, inertial sensors, and UWB measurements, where the weak labels for UWB measurements are produced and iteratively refined by multi-sensory information fusion for self-training. In addition, the system utilizes the maximum likelihood ranging estimator that considers the impact of clock drift. The effectiveness of the proposed system is demonstrated via extensive experimentation in multiple real-world environments, e.g., the proposed methods reduce the NLOS ranging error by 80% and result in a 90th localization error percentile of 0.5 meters in a complex indoor environment.