6.1.1 marmoteCore

• Name:
  Markov Modeling Tools and Environments - the Core
• Keywords:
  Modeling, Stochastic models, Markov model
• Functional Description:

  marmoteCore is a C++ environment for modeling with Markov chains. It consists in a reduced set of high-level abstractions for constructing state spaces, transition structures and Markov chains (discrete-time and continuous-time). It provides the ability of constructing hierarchies of Markov models, from the most general to the particular, and equip each level with specifically optimized solution methods.

  This software was started within the ANR MARMOTE project: ANR-12-MONU-00019.

• News of the Year:
  No active development. Current development lies now in the MARTO project (next generations of PSI and marmoteCore) and in the forthcoming Marmote project.
• URL:
  http://­marmotecore.­gforge.­inria.­fr/
• Publications:
  hal-01651940, hal-01276456
• Contact:
  Alain Jean-Marie
• Participants:
  Alain Jean-Marie, Hlib Mykhailenko, Benjamin Briot, Franck Quessette, Issam Rabhi, Jean-Marc Vincent, Jean-Michel Fourneau
• Partners:
  Université de Versailles St-Quentin-en-Yvelines, Université Paris Nanterre

7.1.1 Calculation of Cumulative Distribution Functions of Sums of Random Vectors

The calculation of cumulative distribution functions (CDFs) of sums of random vectors is omnipresent in the realm of engineering. Approximations to these CDFs, e.g., Gaussian approximations and saddlepoint approximations have gained remarkable popularity. In the case of Gaussian approximations, multi-dimensional Berry-Esseen-type theorems provide upper bounds on the approximation errors. These bounds are particularly precise around the mean. Alternatively, saddlepoint approximations are known to be more precise than Gaussian approximations far apart from the mean. Unfortunately, this claim is often justified by numerical analysis as formal upper bounds on the error induced by saddlepoint approximations are rather inexistent.

In 29 and  54, S. M. Perlaza, together with J.-M. Gorce and D. Anade (both from Inria, MARACAS) and P. Mary (INSA de Rennes), proposed a real-valued function that approximates the CDF of a finite sum of real-valued independent and identically distributed random vectors. The approximation error is upper bounded by an expression that is easy to calculate. As a byproduct, an upper bound and a lower bound on the CDF are obtained. Finally, in the case of lattice and absolutely continuous random variables, the proposed approximation is shown to be identical to the saddlepoint approximation of the CDF.

7.1.2 Controlled Markov Chains and Freshness of Information

Many systems require frequent and regular updates of certain information. These updates have to be transferred regularly from the 5G(s) to a common destination. In 39, K. Veeraruna (IIT Bombay) and E. Altman consider scenarios in which an old packet (entire information unit) becomes completely obsolete, in the presence of a new packet. We consider transmission channels with unit storage capacity; upon arrival of a new packet, if another packet is being transmitted then one of the packets is lost. We consider the control problem that consists of deciding which packet to discard so as to maximise the average age of information (AAoI). We derive drop policies that optimize the AAoI. We show that the state independent (static) policies like dropping always the old packets or dropping always the new packets are optimal in many scenarios, among an appropriate set of stationary Markov policies.

7.1.3 Random Surfers and Prefetching

Prefetching is a basic technique used to reduce the latency of diverse computer services. In 19, K. Keshava, A. Jean-Marie and S. Alouf propose and analyze a model for optimizing the prefetching of documents, in the situation where the connection between documents is discovered progressively. A random surfer moves along the edges of a random tree representing possible sequences of documents, which is known to a controller only up to depth $d$. A quantity $k$ of documents can be prefetched between two movements. The question is to determine which nodes of the known tree should be prefetched so as to minimize the probability of the surfer moving to a node not prefetched. The model is analyzed with the tools of Markov decision process theory. The optimal policy is identified formally in several situations, and only numerically in others.

7.1.4 Count-Min Sketch with Conservative Updates

Count-Min Sketch with Conservative Updates (CMS-CU) is a popular algorithm to approximately count items’appearances in a data stream. Despite CMS-CU’s widespread adoption, the theoretical analysis of its performance is still wanting because of its inherent difficulty. Y. Ben Mazziane, under the supervision of S. Alouf and G. Neglia, has proposed a novel approach to study CMS-CU and derive new upper bounds on the expected value and the CCDF of the count estimation error under an i.i.d. request process. The formulas obtained can be successfully employed to derive improved estimates for the precision of heavy-hitter detection methods and improved configuration rules for CMS-CU. The bounds have been evaluated both on synthetic and real traces.

7.1.5 Infinite Dimensional Linear Programming Approach to Optimal Stochastic Control

In 33, K. Avrachenkov together with V. Gaitsgory and L. Gamertsfelder (both from Macquarie Univ., Australia) study asymptotic properties of problems of control of stochastic discrete time systems with time averaging and time discounting optimality criteria and with general compact state and action spaces (equivalently Markov Decision Processes, MDPs), and they establish that the Cesàro and Abel limits of the optimal values in such problems can be estimated with the help of a certain infinite-dimensional (ID) linear programming (LP) problem and its dual.

7.1.6 Online Algorithms for Estimating Change Rates of Web Pages

A search engine maintains local copies of different web pages to provide quick search results. This local cache is kept up-to-date by a web crawler that frequently visits these different pages to track changes in them. Ideally, the local copy should be updated as soon as a page changes on the web. However, finite bandwidth availability and server restrictions limit how frequently different pages can be crawled. This brings forth the following optimization problem: maximize the freshness of the local cache subject to the crawling frequencies being within prescribed bounds. While tractable algorithms do exist to solve this problem, these either assume the knowledge of exact page change rates or use inefficient methods such as MLE for estimating the same. We address this issue here. In 15 K. Avrachenkov and K. Patil together with G. Thoppe (Indian Institute of Science) provide three novel schemes for online estimation of page change rates, all of which have extremely low running times per iteration. The first is based on the law of large numbers and the second on stochastic approximation. The third is an extension of the second and includes a heavy-ball momentum term. Our main theoretical results concern asymptotic convergence and convergence rates of these three schemes. In fact, our work is the first to show convergence of the original stochastic heavy-ball method when neither the gradient nor the noise variance is uniformly bounded. We also provide some numerical experiments (based on real and synthetic data) to demonstrate the superiority of our proposed estimators over existing ones such as MLE.

7.1.7 Data Injection Attacks in Power Systems

Monitoring and control processes in power systems are supported by supervisory control and data acquisition (SCADA) systems, and more recently, by advanced communication systems that acquire and transmit observations to a state estimator. This new sensing and communication infrastructure, which possesses security vulnerabilities, exposes the power system to malicious attacks. In this context, one of the main threats faced by modern power systems are data injection attacks (DIAs). A DIA can alter the state estimate obtained by the power-system operator by tampering with the observations (measurements) without triggering the attack detection system. In 61, S. M. Perlaza together with X. Ye, I. Esnaola, and R. F. Harrison (all from Univ. of Sheffield, UK) presented sparse attacks that minimize simultaneously the information obtained by the operator and the probability of detection. When the assumption on the sparsity is dropped, S. M. Perlaza together with S. Ke and I. Esnaola (both from Univ. of Sheffield) have studied these attacks in 51.

7.2.1 Clustering Random Geometric Graphs

In 13, K. Avrachenkov, A. Bobu (former postdoctoral fellow in Neo) and M. Dreveton study clustering random geometric graphs. While the standard spectral clustering is often not effective for geometric graphs, they present an effective generalization, which they call higher-order spectral clustering (HOSC). It resembles in concept the classical spectral clustering method but uses for partitioning the eigenvector associated with a higher-order eigenvalue. They establish the weak consistency of this algorithm for a wide class of random geometric graphs which is called Soft Geometric Block Model. A small adjustment of the algorithm provides strong consistency. They also show that the HOSC method is effective in numerical experiments even for graphs of modest size.

7.2.2 Community Recovery in Temporal Networks

In 32, K. Avrachenkov and M. Dreveton together with L. Leskelä (Aalto Univ., Finland) study the recovery of static communities in a temporal network. They introduce a temporal stochastic block model where dynamic interaction patterns between node pairs follow a Markov chain. They render this model versatile by adding degree correction parameters, describing the tendency of each node to start new interactions. It is shown that in some cases the likelihood of this model is approximated by the regularized modularity of a time-aggregated graph. This time aggregated graph involves a trade-off between new edges and persistent edges. A continuous relaxation reduces the regularized modularity maximization to a normalized spectral clustering. The authors illustrate by numerical experiments the importance of edge persistence, both on simulated and real data sets.

7.2.3 Social Networking and Population Dynamics

In 63, A. Hodgkinson (Univ. Exter, UK) and A. Jean-Marie explore the hypothesis that the growth of a population may be limited by the social constraints on pair-bonding (necessary for reproduction in some societies) rather than by ecological constraints. They propose a novel nonlinear Markovian mechanism and embed it within a dynamic graph model, called the Dynamic Markovian Ecological Network (DyME-Net). They study in particular how subdivision in the population may overcome these nonlinearities.

7.3.1 Reinforcement Learning

In 50 K. Avrachenkov and K. Patil together with V.S. Borkar and H. Dolhare (both from Indian Institute of Technology Bombay) analyze the DQN reinforcement learning algorithm, reinforcement learning algorithm with a neural network, as a stochastic approximation scheme using the o.d.e. (for 'ordinary differential equation') approach and point out certain theoretical issues. They then propose a modified scheme called Full Gradient DQN (FG-DQN, for short) that has a sound theoretical basis and compare it with the original scheme on sample problems. They establish a rigorous convergence proof and observe a better performance for FG-DQN on the sample problems.

In 31 K. Avrachenkov and K. Patil together with V.S. Borkar from (Indian Institute of Technology Bombay) apply FG-DQN reinforcement learning algorithm to web crawling. Specifically, a search engine uses a web crawler to crawl the pages from the world wide web (WWW) and aims to maintain its local cache as fresh as possible. Unfortunately, the rates at which different pages change in WWW are highly nonuniform and also, unknown in many real-life scenarios. In addition, the finite available bandwidth and possible server restrictions on crawling frequency make it very difficult for the crawler to find the optimal scheduling policy that maximizes the freshness of the local cache. We model this problem in a multi-armed restless bandits framework, where each arm represents a web page or an aggregate of statistically identical web pages. The objective is to find the scheduling policy that gives the exact indices of the pages to be crawled at a particular instance. We provide an online learning scheme using FG-DQN algorithm which learns the unknown page change dynamics on the fly along with the optimal crawling policy. Finally, we run numerical simulations to compare our approach with state-of-the-art algorithms such as static optimisation and Thompson sampling. We observe better performance for our approach.

7.3.2 Semi-supervised Learning

In 30, K. Avrachenkov and M. Kamalov together with A. Boisbunon (MyDataModels) propose a novel framework called Graph Diffusion & PCA (GDPCA) in the context of semi-supervised learning on graph structured data. It combines a modified Principal Component Analysis with the classical supervised loss and Laplacian regularization, thus handling the case where the adjacency matrix is sparse and avoiding the curse of dimensionality. Our framework can be applied to non-graph datasets as well, such as images by constructing similarity graph. GDPCA improves node classification by enriching the local graph structure by node covariance. We demonstrate the performance of GDPCA in experiments on citation networks and images, and we show that GDPCA compares favourably with the best state-of-the-art algorithms and has significantly lower computational complexity.

7.3.3 Personalized Federated Learning

The increasing size of data generated by smartphones and IoT devices motivated the development of Federated Learning (FL), a framework for on-device collaborative training of machine learning models. First efforts in FL focused on learning a single global model with good average performance across clients, but the global model may be arbitrarily bad for a given client, due to the inherent heterogeneity of local data distributions. Federated multi-task learning (MTL) approaches can learn personalized models by formulating an opportune penalized optimization problem. The penalization term can capture complex relations among personalized models, but eschews clear statistical assumptions about local data distributions.

In 40, O. Marfoq together with G. Neglia, A. Bellet (Inria team MAGNET), R. Vidal (Accenture Labs) and L. Kameni (Accenture Labs) propose to study federated MTL under the flexible assumption that each local data distribution is a mixture of unknown underlying distributions. This assumption encompasses most of the existing personalized FL approaches and leads to federated EM-like algorithms for both client-server and fully decentralized settings. Moreover, it provides a principled way to serve personalized models to clients not seen at training time. The algorithms' convergence is analyzed through a novel federated surrogate optimization framework, which can be of general interest. Experimental results on FL benchmarks show that this approach provides models with higher accuracy and fairness than state-of-the-art methods.

7.3.4 Privacy Leakage in Federated Learning

Federated learning offers naturally a certain level of privacy, as clients’ data is not collected at a third party. However, maintaining the data locally does not provide itself formal privacy guarantees. An (honest-but-curious) adversary can still infer some sensitive client information just by eavesdropping the exchanged messages (e.g., gradients).

In 48, C. Xu, and G. Neglia, initiate the study of local model reconstruction attacks for FL, where a honest-but-curious adversary eavesdrops the messages exchanged between the client and the server and reconstructs the local model of the client. The success of this attack enables better performance of other known attacks, such as the membership attack, attribute inference attacks, etc. They provide analytical guarantees for the success of this attack when training a linear least squares problem with full batch size and arbitrary number of local steps. One heuristic is proposed to generalize the attack to other machine learning problems. Experiments are conducted on logistic regression tasks, showing high reconstruction quality, especially when clients’ datasets are highly heterogeneous (as it is common in FL).

In 49, O. Zari, C. Xu and G. Neglia, study the membership inference attack, where the adversary can infer whether the client owns a specific data instance. They propose a new passive inference attack that requires much less computation power and memory than existing methods. Empirical results show that this attack achieves a higher accuracy on CIFAR100 dataset (more than 4 percentage points) with three orders of magnitude less memory space and five orders of magnitude less calculations.

7.3.5 Dynamic Backup Workers for Parallel Machine Learning

In 26, C. Xu, G. Neglia, in collaboration with N. Sebastianelli (previous intern in Neo), study how to speed up the distributed training of machine learning models in the framework of synchronous parameters server. This paradigm consists of n workers, which iteratively compute updates of the model parameters, and a stateful PS, which waits and aggregates all updates to generate a new estimate of model parameters and sends it back to the workers for a new iteration. Transient computation slowdowns or transmission delays can intolerably lengthen the time of each iteration. An efficient way to mitigate this problem is to let the PS wait only for the fastest $n-b$ updates, before generating the new parameters. The slowest $b$ workers are called backup workers. The correct choice of the number $b$ of backup workers depends on the cluster configuration and workload, but also (as they show in this paper) on the hyper-parameters of the learning algorithm and the current stage of the training. They propose DBW, an algorithm that dynamically decides the number of backup workers during the training process to maximize the convergence speed at each iteration. The experiments show that DBW 1) removes the necessity to tune b by preliminary time-consuming experiments, and 2) makes the training up to a factor 3 faster than the optimal static configuration.

7.3.6 Distributed Inference

An increasing number of applications rely on complex inference tasks that are based on machine learning (ML). Currently, there are two options to run such tasks: either they are served directly by the end device (e.g., smartphones, IoT equipment, smart vehicles), or offloaded to a remote cloud. Both options may be unsatisfactory for many applications: local models may have inadequate accuracy, while the cloud may fail to meet delay constraints. In 44, T. Si Salem, G. Castellano, and G. Neglia, in collaboration with F. Pianese (Nokia Bell Labs), and A. Araldo (Télécom SudParis) present the novel idea of Inference Delivery Networks (IDNs), networks of computing nodes that coordinate to satisfy ML inference requests achieving the best trade-off between latency and accuracy. IDNs bridge the dichotomy between device and cloud execution by integrating inference delivery at the various tiers of the infrastructure continuum (access, edge, regional data center, cloud). Authors propose a distributed dynamic policy for ML model allocation in an IDN by which each node dynamically updates its local set of inference models based on requests observed during the recent past plus limited information exchange with its neighboring nodes. Their policy offers strong performance guarantees in an adversarial setting and shows improvements over greedy heuristics with similar complexity in realistic scenarios.

7.3.7 Empirical Risk Minimization with Relative Entropy Regularization

In the context of the exploratory action IDEM (Information and Decision Making), S. M. Perlaza and A. Jean-Marie, together with G. Bisson (Univ. de la Polynésie française), I. Esnaola (Univ. of Sheffield), and S. Rini (National Chiao Tung Univ.), studied the problem of empirical risk minimization (ERM) with relative entropy regularization (ERM-RER) in the context of supervised learning from the perspective of measure theory. In particular, the relative entropy is assumed to be with respect to a given measure, the reference measure, and not necessarily a probability mesure. This provides a unified treatment of two relevant problems in supervised learning. First, when the reference measure is a probability measure, the ERM-RER problem is shown to be a risk-information minimization problem. Alternatively, when the reference measure is the Lebesgue measure or a counting measure, the solution of the ERM-RER problem is shown to be identical to the solution to an entropy minimization problem with linear constraints, as the one typically induced by Jayne’s maximum entropy principle. The main result consists in a number of properties for the solution to the ERM-RER in terms of the reference measure, the regularization factor, and the training data. Some of the most important properties are described hereunder:

(i) The optimal solution to the ERM-RER is a probability measure that is unique and concentrates into a set arbitrarily small containing the minimizers of the empirical risk with arbitrarily high probability. The tradeoff between the cardinality of such set and the probability is governed by the regularization factor.

(ii) The expected value of the empirical risk, with respect to the ERM-RER optimal measure, is decreasing with the regularization factor. Nonetheless, via simple examples, monotonicity of the variance and higher cumulants is shown to be subject to conditions.

(iii) The transport of the ERM-RER optimal measure through the loss function is a sub-Gaussian probability measure. This property is central to study the sensitivity of the empirical risk for a particular data set with respect to changes around the optimal ERM-RER optimal measure.

7.3.8 Advanced Methods for Data Analytics in Power Systems

A broad view at some advanced topics in data analytics for power systems is presented in the book 52, edited by S. M. Perlaza together with Ali Tajer (Rensselaer Polytechnic Institute, NY, USA) and H. Vincent Poor (Princeton Univ., USA). Therein, experts in data analytics and power engineering present techniques addressing the needs of modern power systems, covering theory and applications related to power system reliability, efficiency, and security. The book explores topics spanning large-scale and distributed optimization, statistical learning, big data analytics, graph theory, and game theory.

7.3.9 Data Analytics for Health Assesments

In 22, S. M. Perlaza and collaborators at Edhec Business School (Nice, France), HEC Montreal (Montreal, QC, Canada), Cimiez Hospital (Nice, France), Univ. Hospital of Nice (Nice, France), Paul Brousse Hospital (Paris, France), and Centre Hospitalier Le Vinatier (Lyon, France), assessed the impact of the COVID-19 pandemic on hospital workers’ psychological parameters and attitudes toward substance use, before and during the French COVID-19 lockdown. An online survey was proposed to the staff of the University Hospital of Nice and Sainte-Marie psychiatric hospital in France assessing changes in daily habits, psychological distress and changes in substance use, including smoking. During the first lockdown, significant psychological changes (sadness, distress, irritability) associated with changes in tobacco use and physical activity were reported. Such results should encourage hospital leaders to implement dedicated policies to better accompany hospital workers’ psychological distress. Data analysis suggests that negative changes in health behaviors are associated with increased psychological distress in hospital workers during the COVID-19 lockdown. Tobacco consumers are having increased psychological distress than their non-consuming counterparts. Health promotion strategies aimed at embracing or preserving positive health behaviors should go toward reducing critical and chronic increases in psychological distress during these unparalleled times. Ongoing assessment of the impact of lockdown and social distancing on health behaviors is needed to shape targeted health promotion strategies.

7.4.1 Dynamic Social Learning under Graph Constraints

In 14, K. Avrachenkov together with V.S. Borkar, S. Moharir and S. M. Shah (all from Indian Institute of Technology Bombay) introduce a model of graph-constrained dynamic social choice with reinforcement modeled by positively $\alpha$-homogeneous rewards. They show that its empirical process, which can be written as a stochastic approximation recursion with Markov noise, has the same probability law as a certain vertex reinforced random walk. Furthermore, its fluid limit has a relation to the replicator dynamics. They use these equivalences to show that for $\alpha >0$, the asymptotic outcome concentrates around the optimum in a certain limiting sense when 'annealed' by letting $\alpha \to \infty$ slowly.

7.4.2 Routing games on loss networks

The work 36 is the fourth in a series of papers that appeared in international conferences that came out of homework by students in a course by E. Altman on initiation to research on routing games. The students, S. Dalalli and C. Fontaine were in their 3rd year in Central-Supelec. They consider a splittable atomic game with lossy links on a ring in which the cost that each player $i$ minimizes is their own loss rate of packets. The costs are therefore non-additive (unlike costs based on delays or tolls) and moreover, there is no flow conservation (total flow entering a link is greater than the flow leaving it). We derive a closed-form for the equilibrium, which allows us to obtain insight on the structure of the equilibrium. We also derive the globally optimal solution and obtain conditions for the equilibrium to coincide with the globally optimal solution.

7.4.3 Epidemic Games

Epidemiology relies on models for propagation in populations through various types of propagation mechanisms. The control of such propagation may be useful in different contexts: in broadcasting information, in epidemic advertisement, in fighting against intrusion and denial of service and more generally in protection in context of cyberwar. On the other hand game theory is a powerful tool for protection against epidemics, and in particular pandemics such as the one due to SARS-CoV-2 (coronavirus). We have been studying during 2021 two game theoretic epidemic models for the study of cooperation versus free riding within various population types. This includes the mask game and the vaccination game.

7.4.4 Games of Water Extraction

In 18, A. Jean-Marie together with M. Tidball (INRAe, France) and V. Bucarey (Univ. O'Higgins, Chile), consider a discrete time, infinite horizon dynamic game of groundwater extraction. A Water Agency charges an extraction cost to water users, and controls the marginal extraction cost so that it depends, not only on the level of groundwater, but also on total water extraction (through a parameter $n$ that represents the degree of strategic interactions between water users) and on rainfall (through parameter $m$). The water users are selfish and myopic, and the goal of the agency is to give them incentives so as to improve their total discounted welfare. The authors look at this problem in several situations. In the first situation, the parameters $n$ and $m$ are considered to be fixed over time. A first result shows that when the Water Agency is patient (the discount factor tends to 1) the optimal marginal extraction cost asks for strategic interactions between agents. The contrary holds for a discount factor near 0. In a second situation, the authors look at the dynamic Stackelberg game where the Agency decides at each time what cost parameter they must announce. they study theoretically and numerically the solution of this problem. Simulations illustrate the possibility that threshold policies are good candidates for optimal policies.

In 57, A. Jean-Marie, T. Jimenez (Univ. Avignon) and M. Tidball (INRAe, France), consider the application of conjectural learning to a water management model. They introduce the family of Conjectural Learning procedures, in which agents form conjectures about what the opponent will play, as a function of their action or some state variable. They prove general properties of these procedures, comparing them to two dynamic systems generated by nearsighted agents solving repeatedly a static game, either cooperatively, or noncooperatively. They then specify three simple functional forms of conjectures and analyze the five resulting dynamic systems, in terms of steady states and convergence conditions. They next further specify these procedures to the case of a game of groundwater management, using a quadratic functional form for the profit function of agents. They obtain then explicit expressions for steady states and convergence conditions for the dynamic systems. Finally, they conduct numerical experiments in order to assess the “performance” of pairs of agents adopting each of the five behaviors.

7.5.1 Caching

Participants: Olga Chuchuk, Guilherme Iecker Ricardo, Giovanni Neglia, Tareq Si Salem.

7.5.2 5G Cellular Networks

Participants: Eitan Altman, Mandar Datar, Marie Masson, Samir Medina Perlaza, Sadaf Ul Zuhra.

Several networking applications studied in Neo are specifically on 5G or 6G networks.

7.5.3 Graph Neural Networks based Scheduling

Participants: Eitan Altman, Ramakrishnan Sambamoorthy.

In 43, R. Sambamoorthy and E. Altman in cooperation with J. Mandalapu, S. Peruru, B. Jain (IIT Madras and Kanpur) propose a Graph Convolutional Neural Networks (GCN) based scheduling algorithm for ad-hoc networks. In particular, we consider a generalized interference model called the k-tolerant conflict graph model and design an efficient approximation for the well-known Max-Weight scheduling algorithm. A notable feature of this work is that the proposed method do not require labeled data set (NP-hard to compute) for training the neural network. Instead, we design a loss function that utilises the existing greedy approaches and trains a GCN that improves the performance of greedy approaches. Our extensive numerical experiments illustrate that using our GCN approach, we can significantly (4-20 percent) improve the performance of the conventional greedy approach.

7.5.4 Distributed Denial of Service Attacks

Participant: Philippe Nain.

Botnets such as Mirai use insecure home devices to conduct Distributed Denial of Service (DDoS) attacks on the Internet infrastructure. Although some of those attacks involve large amounts of traffic, they are generated from a large number of homes, which hampers their early detection. In 12, P. Nain in collaboration with A. Ramtin and D. Towsley (both from Univ. Massachusetts), D. Sadoc Menasche and E. de Souza e Silva (both from Federal Univ. of Rio Janeiro), addresses the following question: what is the maximum amount of damage that a DDoS attacker can produce at the network edge without being detected? To that aim, the authors consider a statistical hypothesis testing approach for attack detection at the network edge. The proposed system assesses the goodness of fit of traffic models based on the ratio of their likelihoods. Under such a model, it is shown that the amount of traffic that can be generated by a covert attacker scales according to the square root of the number of compromised homes. Theoretical results are evaluated and validated using real data collected from thousands of home-routers connected to a mid-sized Internet service provider.

8.1.1 ADR Nokia on the topic “Distributed Learning and Control for Network Analysis” (October 2017 – September 2021)

Participants: Eitan Altman, Konstantin Avrachenkov, Jake Clarkson, Mandar Datar, Maximilien Dreveton.

• Contractor: Nokia Bell Labs
• Collaborator: Gérard Burnside

Over the last few years, research in computer science has shifted focus to machine learning methods for the analysis of increasingly large amounts of user data. As the research community has sought to optimize the methods for sparse data and high-dimensional data, more recently new problems have emerged, particularly from a networking perspective that had remained in the periphery.

The technical program of this ADR consists of three parts: Distributed machine learning, Multiobjective optimisation as a lexicographic problem, and Use cases / Applications. We address the challenges related to the first part by developing distributed optimization tools that reduce communication overhead, improve the rate of convergence and are scalable. Graph-theoretic tools including spectral analysis, graph partitioning and clustering will be developed. Further, stochastic approximation methods and D-iterations or their combinations will be applied in designing fast online unsupervised, supervised and semi-supervised learning methods.

8.1.2 ADR Nokia on the topic “Rethinking the network: virtualizing network functions, from middleboxes to application” (October 2017 – February 2022)

Participants: Sara Alouf, Gabriele Castellano, Giovanni Neglia.

• Contractor: Nokia Bell Labs
• Collaborators: Fabio Pianese, Massimo Gallo

A growing number of network infrastructures are being presently considered for a software-based replacement: these range from fixed and wireless access functions to carrier-grade middle boxes and server functionalities. On the one hand, performance requirements of such applications call for an increased level of software optimization and hardware acceleration. On the other hand, customization and modularity at all layers of the protocol stack are required to support such a wide range of functions. In this scope the ADR focuses on two specific research axes: (1) the design, implementation and evaluation of a modular NFV architecture, and (2) the modelling and management of applications as virtualized network functions. Our interest is in low-latency machine learning prediction services and in particular how the quality of the predictions can be traded off with latency.

8.1.3 Orange CIFRE on the topic “Self-organizing features in the virtual 5G radio access network” (November 2017 – October 2020)

Participants: Eitan Altman, Marie Masson.

• Contractor: Orange Labs
• Collaborator: Zwi Altman

The considerable extent of the complexity of 5G networks and their operation is in contrast with the increasing demands in terms of simplicity and efficiency. This antagonism highlights the critical importance of network management. Self-Organizing Networks (SON), which cover self-configuration, self-optimization and self-repair, play a central role for 5G Radio Access Network (RAN).

This CIFRE thesis aims at innovating in the field of managing 5G RAN, with a special focus on the features of the SON-5G. Three objectives are identified: a) develop self-organizing features (SON in 5G-RAN), b) develop cognitive managing mechanisms for the SON-5G features developed, and c) demonstrate how do the self-organizing mechanisms fit in the virtual RAN.

8.1.4 Accenture contract on the topic “Distributed Machine Learning for IoT applications” (Dec 2019 – November 2023)

Participants: Othmane Marfoq, Giovanni Neglia.

• Contractor: Accenture Labs
• Collaborators: Laetitia Kameni, Richard Vidal

IoT applications will become one of the main sources to train data-greedy machine learning models. Until now, IoT applications were mostly about collecting data from the physical world and sending them to the Cloud. Google’s federated learning already enables mobile phones, or other devices with limited computing capabilities, to collaboratively learn a machine learning model while keeping all training data locally, decoupling the ability to do machine learning from the need to store the data in the cloud. While Google envisions only users’ devices, it is possible that part of the computation is executed at other intermediate elements in the network. This new paradigm is sometimes referred to as Edge Computing or Fog Computing. Model training as well as serving (provide machine learning predictions) are going to be distributed between IoT devices, cloud services, and other intermediate computing elements like servers close to base stations as envisaged by the Multi-Access Edge Computing framework. The goal of this project is to propose distributed learning schemes for the IoT scenario, taking into account in particular its communication constraints. A first 12-month pre-PhD contract has been followed by a PhD grant.

8.1.5 MyDataModels contract on the topic “Semi-supervised variational autoencoders for versatile data” (June 2019 – May 2022)

Participants: Konstantin Avrachenkov, Mikhail Kamalov.

• Contractor: MyDataModels
• Collaborators: Denis Bastiment, Aurélie Boisbunon

Variational autoencoders are highly flexible machine learning techniques for learning latent dimension representation. This model is applicable for denoising data as well as for classification purposes. In this thesis we plan to add semi-supervision component to the variational autoencoder techniques. We plan to develop methods which are universally applicable to versatile data such as categorical data, images, texts, etc. Initially starting from static data we aim to extend the methods to time-varying data such as audio, video, time-series, etc. The proposed algorithms can be integrated into the internal engine of MyDataModels company and tested on use cases of MyDataModels.

8.1.6 Qu’est-ce qui tourne contract on “Recommendation system for automatic suggestion of theatres to show producers” (1 January 2021 – 31 July 2021)

Participants: Konstantin Avrachenkov, Alain Jean-Marie.

• Contractor: Qu’est-ce qui tourne (QQT)
• Collaborators: Pierre Beffeyte, Benoit Justeau

In this project, together with InriaTech (Jean-Luc Szpyrka, Riham Nehmeh), we have designed, prototyped and tested a recommendation system for automatic suggestion of theatres to show producers. In particular, it was very interesting to observe that our Personalized PageRank, graph-based recommendation system performs much better than a more standard text-based recommendation system.

8.1.7 NSP-SmartProfile contract on the topic “Recommendation systems with heterogeneous data” (1 March 2021 – 31 August 2021)

Participants: Konstantin Avrachenkov, Ibtihal El Mimouni.

• Contractor: NSP-SmartProfile
• Collaborators: Julien Musso, Hervé Baile

SmartProfile is a marketing platform that allows to collect, to enhance and to analyse marketing data. Typically the data is very heterogeneous (binary data, integer numbers, real numbers, functional data, images, etc) This contract was funding the internship of Ibtihal El Mimouni on the exploratory investigation of recommendation systems with heterogeneous data. Currently, we are following up with Cifre application.

9.1.1 Participation in other International Programs

The Embassy of France in the United States, via the progamme “make our planet great again”, has funded an initiative led by S. M. Perlaza and A. Tajer (RPI, USA) for addressing foundational questions pertinent to two emerging wireless communication technologies: (i) energy harvesting (EH) systems, and (ii) ultra low-latency systems for critical missions. This project explores two strongly symbiotic research directions for establishing the fundamental limits of (i) data transmission and, (ii) simultaneous energy and data transmission, in mission critical systems empowered by EH. The expected results have applications in, e.g., disaster relief, medical instruments, cyber-physical systems, and the Internet of things. This program was launched by the President of France Emmanuel Macron in June 2017 and handled by the Embassy of France in the United States of America. The aim of such fellowships is to reinforce the international engagements of the 2015 Paris Agreement on Climate Change by fostering collaborations between scholars in both US and France.

9.2.1 Visits of international scientists

9.2.2 Visits to international teams

9.3.1 FP7 & H2020 projects

PIA ANSWER

Participants: Konstantin Avrachenkov, Kishor Yashavant Patil.

• Project Acronym:
  ANSWER
• Project Title:
  Advanced aNd Secured Web Experience and seaRch
• Coordinator:
  QWANT
• Duration:
  15 November 2017 – 31 July 2021
• Others Partners:
  Inria Project-Teams WIMMICS, INDES, COFFEE
• Abstract:

  ANSWER is a joint project between Qwant and Inria, funded by the French Government's initiative PIA “Programme d'Investissement d'Avenir”.

  The aim of the ANSWER project is to develop the new version of the search engine of Qwant by introducing radical innovations in terms of search criteria as well as indexed content and security. This initiative is a part of the Big Data Big Digital Challenges field, since a Web search engine deals with large volumes of heterogeneous and dynamic data.

  Of the five characteristics of big data, the ANSWER project will focus more particularly on the aspects of Velocity in terms of near real-time processing of results, and Variety for the integration of new indicators (emotions, sociality, etc.) and meta-data. The Volume, Value and Veracity aspects will necessarily be addressed jointly with these first ones and will also be the subject of locks, especially on the topics of crawling and indexing.

  This registration of the search engine in the Big Data domain will only be reinforced by developments in the Web such as the Web of data, and generally by the current trend to integrate the Web of increasingly diverse, rich and complex resources.

ANR MAESTRO5G

Participant: Eitan Altman.

• Project Acronym:
  MAESTRO5G
• Project Title:
  MAnagEment of Slices in The Radio access Of 5G networks
• Coordinator:
  Orange Labs
• Duration:
  February 2019 – January 2022
• Others Partners:
  Nokia Bell Labs, U. Avignon, Inria Project-Team Agora, Sorbonne U., Telecom SudParis, CentraleSupélec.
• Abstract:
  The project develops enablers for implementing and managing slices in the 5G radio access network, not only for the purpose of serving heterogeneous services, but also for dynamic sharing of infrastructure between operators. MAESTRO-5G develops a framework for resource allocation between slices and a business layer for multi-tenant slicing. It provides an orchestration framework based on Software Define Networking that manages resources and virtual functions for slices. A hardware demonstrator brings the slicing concept to reality and showcases the project’s innovations.

Exploratory action Inria MAMMALS

• Project Acronym:
  MAMMALS
• Project Title:
  Memory-augmented Models for low-latency Machine-learning Serving
• Coordinator:
  Giovanni Neglia
• Duration:
  November 2020 - November 2022
• Others Partners:
  Univ. Turin, Polytechnic Turin, Univ. Verona, Univ. of Massachusetts, Northeastern Univ.
• Abstract:
  A machine learning model is often trained for inference’s purposes. Inference does not involve complex iterative algorithms and is therefore generally presumed to be easy. Nevertheless, it presents fundamental challenges that are likely to become dominant as machine learning adoption increases and machine learning systems are ubiquitously deployed and need to make timely and safe decisions in unpredictable environments. MAMMALS aims to provide low-latency inferences by running—close to the end user—simple machine learning models that can also take advantage of a (small) local data store of examples. The focus is on algorithms to learn online what to store locally to improve inference quality and achieve domain adaptation.

Exploratory action Inria IDEM

• Project Acronym:
  IDEM
• Project Title:
  Information and Decision Making
• Coordinators:
  Samir Medina Perlaza, Alain Jean-Marie
• Duration:
  November 2021 - November 2023
• Others Partners:
  Univ. of Sheffield, the National Chiao Tung Univ. in Taiwan, Princeton Univ.
• Abstract:
  IDEM aims to characterize the interplay between data acquisition and information processing in decentralized decision making by bringing together tools from information theory and game theory. This characterization is central in the comprehension of problems including decentralized optimization and Machine Learning subject to local information constraints.

10.1.1 Scientific events: organisation

10.1.2 Scientific events: selection

10.1.3 Journal

10.1.4 Invited talks

• E. Altman
  was Keynote in Valuetools 2021.
• G. Neglia
  • gave a talk on “Personalized Federated Learning” at Nokia Bell Labs' “Big Thought Time Talk” seminars on 9/12/2021.
  • gave a talk on “Personalized Federated Learning” at SophIA Summit on 19/11/2021.
• S. M. Perlaza
  • presented the keynote: “Shannon’s Mathematical Theory of Data Transmission”, at the conference Géométrie algébrique, Théorie des nombres et Applications, University of French Polynesia, Tahiti, French Polynesia, August 2021.
  • was invited to deliver the talk “An upper bound on the error induced by saddlepoint approximations: Applications to information theory” in the School of Electrical, Computer, and Systems Engineering at Rensselear Polytechnic Institute (RPI), NY, USA. (postponed until further notice)

10.1.5 Leadership within the scientific community

• S. Alouf
  • is an elected member at the Board of Directors of ACM SIGMETRICS (July 2019 - June 2023);
  • is a member of the Equality and Diversity committee of ACM SIGMETRICS;
  • is a member of the Conference Advisory committee of ACM SIGMETRICS.
• K. Avrachenkov
  • is a member of the scientific committee for Labex UCN@Sophia;
  • is a member of Conseil Scientifique & Pédagogique EUR DS4H Univ. Côte d'Azur.
• S. M. Perlaza
  • is a member of the Digital Presence Committee of the IEEE Information Theory Society. Dec. 2019 - Dec. 2024.
  • is a Senior Member of the IEEE (class of 2015);
  • is a Marie Sklodowska-Curie Action (MSCA) Fellow. Individual Fellowship, (Class of 2015);

10.1.6 Research administration

• S. Alouf
  • is a member of NICE, the Invited Researchers Committee of Inria Sophia Antipolis Méditerranée, since June 2020;
  • is member of CLF, the training committee of Inria Sophia Antipolis Méditerranée, since November 2014;
  • is vice-head of project-team Neo since January 2017.
• K. Avrachenkov
  • is in charge of RAWeb process for Inria SAM;
• A. Jean-Marie
  • is the scientific coordinator of Inria activities in Montpellier (since 2008); as part of this duty, he represents Inria at: the Scientific Council of the Doctoral School “Sciences and Agrosciences” of the Univ. of Avignon; at the Regional Conference of Research Organisms (CODOR); at the board of the Labex NUMEV.
  • is Head of project-team NEO since January 2017.
• G. Neglia
  • is a committee member for UCA Academy of Excellence “Networks, Information, and Digital Society” since 2021;
  • is member of Inria COST GTRI (groupe de travail des relations internationales du comité d’orientation scientifique et technique) since 2016

10.2.1 Teaching

Note: UCA is the Univ Côte d'Azur.

10.2.2 Supervision

10.2.3 Juries

International journals

• 11 articleE.Eitan Altman, M.Mandar Datar, F.Francesco De Pellegrini, S.Samir Perlaza and D. S.Daniel Sadoc Menasché. The Mask Game with Multiple Populations.Dynamic Games and Applications2022
  HALback to text
• 12 articleR.Reza Amir, P.Philippe Nain, D.Daniel Sadoc Menasche, D.Don Towsley and E.Edmundo De Souza. Fundamental Scaling Laws of Covert DDoS Attacks.Performance Evaluation151November 2021
  HALback to text
• 13 articleK.Konstantin Avrachenkov, A.Andrei Bobu and M.Maximilien Dreveton. Higher-Order Spectral Clustering for Geometric Graphs.Journal of Fourier Analysis and Applications27March 2021
  HALDOIback to textback to text
• 14 articleK.Konstantin Avrachenkov, V. S.Vivek S Borkar, S.Sharayu Moharir and S. M.Suhail Mohmad Shah. Dynamic social learning under graph constraints.IEEE Transactions on Control of Network SystemsSeptember 2021
  HALDOIback to text
• 15 articleK.Konstantin Avrachenkov, K.Kishor Patil and G.Gugan Thoppe. Online algorithms for estimating change rates of web pages.Performance Evaluation153November 2021
  HALDOIback to text
• 16 articleO.Olga Chuchuk, T.Thomas Beermann, A.Alessandro Di Girolamo, M.Maria Grigorieva, A.Alexei Klimentov, M.Mario Lassnig, M.Markus Schulz, A.Andrea Sciaba and E.Eugeny Tretyakov. Methods of Data Popularity Evaluation in the ATLAS Experiment at the LHC.EPJ Web of Conferences2512021
  HALDOIback to text
• 17 articleM.Michele Garetto, E.Emilio Leonardi and G.Giovanni Neglia. Content placement in networks of similarity caches.Computer Networks201December 2021, 108570
  HALDOIback to text
• 18 articleA.Alain Jean-Marie, M.Mabel Tidball and V.Víctor Bucarey. The Stackelberg games of water extraction with myopic agents.International Game Theory Review2022
  HALback to text
• 19 articleK.Kausthub Keshava, A.Alain Jean-Marie and S.Sara Alouf. Optimal Prefetching in Random Trees.Mathematics 919October 2021, 2437
  HALDOIback to text
• 20 articleY.Yuanyuan Li, T.Tareq Si Salem, G.Giovanni Neglia and S.Stratis Ioannidis. Online Caching Networks with Adversarial Guarantees.Proceedings of the ACM on Measurement and Analysis of Computing Systems 5December 2021, 1 - 39
  HALDOIback to text
• 21 articleX.Xutong Liu, Y.-Z. J.Yu-Zhen Janice Chen, J. C.John Chi Shing Lui and K.Konstantin Avrachenkov. Learning to count: A deep learning framework for graphlet count estimation.Network Science9October 2021, S23-S60
  HALDOI
• 22 articleI.Izza Mounir, L.Loick MENVIELLE, S.Samir Perlaza, D.Denis Chênevert, J.-H.Jo-Hanna Planchard, R.Roxane Fabre, M.Michel Benoit, A.Amine Benyamina, B.Benjamin Rolland, F.Faredj Cherikh and R.Renaud David. Psychological Distress and Tobacco Use Among Hospital Workers During COVID-19.Frontiers in Psychiatry12July 2021
  HALDOIback to text
• 23 articleG.Giovanni Neglia, M.Michele Garetto and E.Emilio Leonardi. Similarity Caching: Theory and Algorithms.IEEE/ACM Transactions on NetworkingDecember 2021, 1-12
  HALDOIback to text
• 24 articleG.Giovanni Neglia, E.Emilio Leonardi, G. I.Guilherme Iecker Ricardo and T.Thrasyvoulos Spyropoulos. A Swiss Army Knife for Online Caching in Small Cell Networks.IEEE/ACM Transactions on NetworkingAugust 2021, 1-12
  HALDOIback to textback to text
• 25 articleG. I.Guilherme Iecker Ricardo, A.Alina Tuholukova, G.Giovanni Neglia and T.Thrasyvoulos Spyropoulos. Caching Policies for Delay Minimization in Small Cell Networks with Coordinated Multi-Point Joint Transmissions.IEEE/ACM Transactions on Networking293June 2021, 1105-1115
  HALDOIback to text
• 26 articleC.Chuan Xu, G.Giovanni Neglia and N.Nicola Sebastianelli. Dynamic Backup Workers for Parallel Machine Learning.Computer NetworksApril 2021
  HALback to text

International peer-reviewed conferences

• 27 inproceedingsE.Eitan Altman, M.Mandar Datar and G.Ghilas Ferrat. Maximizing amount of transferred traffic for battery powered mobiles.Netgcoop 2020 - International Conference on NETwork Games, Control and OptimisationCargese, FranceSeptember 2021
  HALback to text
• 28 inproceedingsE.Eitan Altman. The vaccination Game in Susceptible-Infected-Susceptible (SIS) networks with multipopulations.Game Theory for Networks (Gamenets) 2021Virtual, FranceDecember 2021
  HALback to text
• 29 inproceedingsD.Dadja Anade, J.-M.Jean-Marie Gorce, P.Philippe Mary and S. M.Samir M Perlaza. Saddlepoint Approximations of Cumulative Distribution Functions of Sums of Random Vectors.ISIT 2021 - IEEE International Symposium on Information TheoryMelbourne / Virtual, AustraliaIEEEJuly 2021, 1-6
  HALback to text
• 30 inproceedingsK.Konstantin Avrachenkov, A.Aurélie Boisbunon and M.Mikhail Kamalov. Graph Diffusion & PCA Framework for Semi-supervised Learning.Learning and Intelligent Optimization (LION 2021)12931Lecture Notes in Computer ScienceAthens, GreeceSpringer International PublishingDecember 2021, 25-39
  HALDOIback to text
• 31 inproceedingsK.Konstantin Avrachenkov, V.Vivek Borkar and K.Kishor Patil. Deep Reinforcement Learning for Web Crawling.The Seventh Indian Control Conference 2021Mumbai, IndiaDecember 2021
  HALback to text
• 32 inproceedingsK.Konstantin Avrachenkov, M.Maximilien Dreveton and L.Lasse Leskelä. Recovering Communities in Temporal Networks Using Persistent Edges.CSoNet 2021 - International Conference on Computational Data and Social Networks13116Lecture Notes in Computer ScienceMontreal, CanadaSpringer International PublishingDecember 2021, 243-254
  HALDOIback to textback to text
• 33 inproceedingsK.Konstantin Avrachenkov, V.Vladimir Gaitsgory and L.Lucas Gamertsfelder. LP Based Bounds for Cesàro and Abel Limits of the Optimal Values in Non-ergodic Stochastic Systems.2021 European Control Conference (ECC)Delft, NetherlandsIEEEJuly 2021, 2444-2449
  HALDOIback to text
• 34 inproceedingsK.Konstantin Avrachenkov and M.Maksim Mironov. Cluster-size constrained network partitioning.ICPR 2020 - 25th International Conference on Pattern RecognitionMilano, ItalyJanuary 2021
  HAL
• 35 inproceedingsD.Damiano Carra and G.Giovanni Neglia. Taking two Birds with one k-NN Cache.Proceedings of IEEE Global Communications ConferenceMadrid, SpainDecember 2021
  HALback to text
• 36 inproceedingsS.Sami Dallali, C.Clara Fontaine and E.Eitan Altman. Splittable Routing Games in Ring Topology with Losses.ASMTA 2021 - 26th International Conference on Analytical & Stochastic Modelling Techniques & ApplicationsVirtual, JapanDecember 2021
  HALback to text
• 37 inproceedingsM.Mandar Datar and E.Eitan Altman. Strategic Resource Management in 5G Network Slicing. (Invited paper).ITC 33 - Networked Systems and ServicesAvignon, FranceAugust 2021
  HALback to text
• 38 inproceedingsG.Guilherme IECKER RICARDO, G.Giovanni Neglia and T.Thrasyvoulos Spyropoulos. Caching Heterogeneous Size Content in Small Cell Networks with CoMP Joint Transmissions.GLOBECOM 2021, IEEE Global Communications ConferenceGLOBECOM 2021, IEEE Global Communications Conference, 7-11 December 2021, Madrid, SpainGLOBECOM 2021, IEEE Global Communications ConferenceMadrid, SpainDecember 2021
  HALback to text
• 39 inproceedingsV.Veeraruna Kavitha and E.Eitan Altman. Controlling Packet Drops to Improve Freshness of information.Netgcoop 2020 - International Conference on NETwork Games, Control and OptimisationCargese, FranceSeptember 2021
  HALback to text
• 40 inproceedingsO.Othmane Marfoq, G.Giovanni Neglia, A.Aurélien Bellet, L.Laetitia Kameni and R.Richard Vidal. Federated Multi-Task Learning under a Mixture of Distributions.NeurIPS 2021 - 35th Conference on Neural Information Processing SystemsSydney, AustraliaDecember 2021
  HALback to text
• 41 inproceedingsM.Marie Masson, Z.Zwi Altman and E.Eitan Altman. Coordinated scheduling based on automatic neighbor beam relation.NETGCOOP 2020 - International Conference on NETwork Games, Control and OptimisationCargèse, FranceMarch 2021
  HALback to text
• 42 inproceedingsA.Anirudh Sabnis, T.Tareq Si Salem, G.Giovanni Neglia, M.Michele Garetto, E.Emilio Leonardi and R. K.Ramesh K Sitaraman. GRADES: Gradient Descent for Similarity Caching.IEEE INFOCOM 2021 - IEEE Conference on Computer CommunicationIEEE International Conference on Computer Communications (INFOCOM 2021)Virtual Conference, United StatesMay 2021
  HALback to text
• 43 inproceedingsR.Ramakrishnan Sambamoorthy, J.Jaswanthi Mandalapu, S. S.Subrahmanya Swamy Peruru, B.Bhavesh Jain and E.Eitan Altman. Graph Neural Network based scheduling : Improved throughput under a generalized interference model.EAI - ValuetoolsGuangzhou, ChinaOctober 2021
  HALback to text
• 44 inproceedingsT.Tareq Si Salem, G.Gabriele Castellano, G.Giovanni Neglia, F.Fabio Pianese and A.Andrea Araldo. Towards inference delivery networks: distributing machine learning with optimality guarantees.19th Mediterranean Communication and Computer Networking Conference (MEDCOMNET 2021)19th Mediterranean Communication and Computer Networking Conference (MEDCOMNET 2021)Ibiza (virtual), SpainIEEE2021, 1-8
  HALDOIback to text
• 45 inproceedingsT.Tareq Si Salem, G.Giovanni Neglia and D.Damiano Carra. AÇAI: Ascent Similarity Caching with Approximate Indexes.The 33rd International Teletraffic Congress (ITC 33)The 33rd International Teletraffic Congress (ITC 33)Avignon (virtual), FranceAugust 2021
  HALback to textback to text
• 46 inproceedingsT.Tareq Si Salem, G.Giovanni Neglia and S.Stratis Ioannidis. No-Regret Caching via Online Mirror Descent.IEEE International Conference on Communications (ICC 2021)IEEE International Conference on Communications (ICC 2021)Montreal (virtual), CanadaJuly 2021
  HALback to text
• 47 inproceedingsS. u.Sadaf ul Zuhra, S. M.Samir M Perlaza and E.Eitan Altman. Simultaneous Information and Energy Transmission with Finite Constellations.ITW 2021 - IEEE Information Theory WorkshopKanazawa, JapanIEEEOctober 2021, 1-6
  HALback to text

Conferences without proceedings

• 48 inproceedings C.Chuan Xu and G.Giovanni Neglia. What else is leaked when eavesdropping Federated Learning? CCS workshop Privacy Preserving Machine Learning (PPML) Soeul, South Korea November 2021
  HAL DOI back to text
• 49 inproceedingsO.Oualid Zari, C.Chuan Xu and G.Giovanni Neglia. Efficient passive membership inference attack in federated learning.Privacy in Machine Learning - NeurIPS PriML workshopVirtual, FranceDecember 2021
  HALback to text

Scientific book chapters

• 50 inbookK.Konstantin Avrachenkov, V. S.Vivek S Borkar, H. P.Harsh P Dolhare and K.Kishor Patil. Full Gradient DQN Reinforcement Learning: A Provably Convergent Scheme.41Modern Trends in Controlled Stochastic Processes: Theory and Applications, V.IIIEmergence, Complexity and ComputationSpringer International PublishingJune 2021, 192-220
  HALDOIback to text
• 51 inbookI.Iñaki Esnaola, S. M.Samir M. Perlaza and K.Ke Sun. Data-Injection Attacks.Advanced Data Analytics for Power SystemsJanuary 2021
  HALback to text

Edition (books, proceedings, special issue of a journal)

• 52 bookA.Ali Tajer, S. M.Samir M. Perlaza and H. V.H. Vincent Poor. Advanced Data Analytics for Power Systems.Cambridge University PressJanuary 2021
  HALback to text

Doctoral dissertations and habilitation theses

• 53 thesisS. M.Samir M. Perlaza. Contributions to Information and Energy Systems.INSA de Lyon; Université Claude Bernard Lyon IJune 2021
  HALback to text

Reports & preprints

• 54 reportD.Dadja Anade, J.-M.Jean-Marie Gorce, P.Philippe Mary and S. M.Samir M. Perlaza. Saddlepoint Approximations of Cumulative Distribution Functions of Sums of Random Vectors.RR-9388Inria Grenoble - Rhône-AlpesMay 2021, 32
  HALback to text
• 55 reportV.Víctor Bucarey, E.Eugenio Della Vecchia, A.Alain Jean-Marie and F.Fernando Ordóñez. Stationary Strong Stackelberg Equilibrium in Discounted Stochastic Games.RR-9271InriaMarch 2021, 62
  HAL
• 56 miscM.Mandar Datar, E.Eitan Altman and H.Hélène Le Cadre. Strategic Resource Pricing and Allocation in a 5G Network Slicing Stackelberg Game.January 2022
  HAL
• 57 reportA.Alain Jean-Marie, T.Tania Jimenez and M.Mabel Tidball. Nearsighted, farsighted behaviors and learning. Application to a groundwater management problem.RR-9406InriaApril 2021, 46
  HALback to text
• 58 miscA.Alexandre Reiffers-Masson, N.Nahum Shimkin, D.Daniel Sadoc Menasche and E.Eitan Altman. A Backpropagation Approach for Distributed Resource Allocation.July 2021
  HAL
• 59 miscA.Augusto Sales-De-Queiroz, G. G.Guilherme Guilherme Sales Santa Cruz, A.Alain Jean-Marie, D.Dorian Mazauric, J.Jérémie Roux and F.Frédéric Cazals. Gene prioritization based on random walks with restarts and absorbing states, to define gene sets regulating drug pharmacodynamics from single-cell analyses.November 2021
  HAL
• 60 miscR.Ramakrishnan Sambamoorthy, M.Mandar Datar and E.Eitan Altman. A Bidding Mechanism for Resource Allocation in Network Slicing.September 2021
  HAL
• 61 miscX.Xiuzhen Ye, I.Iñaki Esnaola, S. M.Samir M Perlaza and R. F.Robert F Harrison. Stealth Data Injection Attacks with Sparsity Constraints.January 2022
  HALback to text
• 62 reportS. u.Sadaf ul Zuhra, S. M.Samir M. Perlaza and E.Eitan Altman. Simultaneous Information and Energy Transmission with Finite Constellations.RR-9409Inria Sophia Antipolis - MéditerranéeMay 2021, 17
  HALback to text

Other scientific publications

• 63 inproceedingsA.Arran Hodgkinson and A.Alain Jean-Marie. Social Networking and Population Growth - A complex mathematical relationship.FRCCS 2021 - French Regional Conference on Complex SystemsDijon, FranceMay 2021
  HALback to text