Publications associées à Locally Private Graph Neural Networks

Publications associées (27)

Multimodal Prediction Framework for Total Shoulder Arthroplasty Outcomes: Integrating Morphological, Musculoskeletal, Finite Element, and Bayesian Causal Models

This thesis aimed to estimate the effect of demographic and biomechanical preoperative variables on total shoulder arthroplasty (TSA) outcomes. To achieve this, various biomechanical variables were calculated using a clinical database comprising normal and ...

EPFL2025

An Information-Theoretic Framework for Multiplex Graphs

Anda Skeja

This thesis presents a comprehensive theory of information-theoretic measures for characterizing the complexity and higher-order dependence structures of graphs. We introduce multivariate complexity and dependence measures for graphs within the framework o ...

EPFL2024

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

Rom Pinchasi

Let F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...

Electronic Journal Of Combinatorics2024

On the fundamental limits of privacy-enhancing technologies

Theresa Stadler

The advancement of data-driven decision making has become a key priority in political agendas and private sector strategies. However, the growing demand for data and the opacity of data-driven systems raise concerns about the threats to individual privacy ...

EPFL2024

The Architectural Space and the Healing Bed: On the Dimension of Privacy in Hospital Architectures

Anja Fröhlich

Building Early Modern Privacy Organizer: Centre for Privacy Studies, University of Copenhagen, and the Royal Danish Academy—Architecture, Design, Conservation, Institute of Architecture and Design The PRIVACY research team examines how notions of privacy ...

2024

Maximum Independent Set: Self-Training through Dynamic Programming

Volkan Cevher, Grigorios Chrysos, Efstratios Panteleimon Skoulakis

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

2023

Better Trees for Santa Claus

Etienne Michel François Bamas, Lars Rohwedder

We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC'09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem ...

Assoc Computing Machinery2023

Quantization for Decentralized Learning Under Subspace Constraints

Ali H. Sayed, Stefan Vlaski, Roula Nassif

In this article, we consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints that require the minimizers across the network to lie in low-dimensional subspaces. This constrained fo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Bridging the gap between theoretical and practical privacy technologies for at-risk populations

Kasra Edalatnejadkhamene

With the pervasive digitalization of modern life, we benefit from efficient access to information and services. Yet, this digitalization poses severe privacy challenges, especially for special-needs individuals. Beyond being a fundamental human right, priv ...

EPFL2023

High-order accurate well-balanced energy stable adaptive moving mesh finite difference schemes for the shallow water equations with non-flat bottom topography

Junming Duan, Zhenying Zhang

This paper proposes high-order accurate well-balanced (WB) energy stable (ES) adaptive moving mesh finite difference schemes for the shallow water equations (SWEs) with non flat bottom topography. To enable the construction of the ES schemes on moving mesh ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

A Large-Scale Characterization of How Readers Browse Wikipedia

Robert West, Tiziano Piccardi, Akhil Arora

Despite the importance and pervasiveness of Wikipedia as one of the largest platforms for open knowledge, surprisingly little is known about how people navigate its content when seeking information. To bridge this gap, we present the first systematic large ...

ASSOC COMPUTING MACHINERY2023

A Practical Wave Optics Reflection Model for Hair and Fur

Mengqi Xia

Traditional fiber scattering models, based on ray optics, are missing some important visual aspects of fiber appearance. Previous work [Xia et al. 2020] on wave scattering from ideal extrusions demonstrated that diffraction produces strong forward scatteri ...

2023

Machine-learning predictor of nerve fiber firing rate allows the automatic optimization of electrical stimulation protocols

Silvestro Micera, Simone Romeni, Gabriele Marino

Computational models have been widely employed to study the electrical stimulation of the nervous system. Still, most applications either study fundamental mechanisms underlying stimulation, or address qualitative scientific questions. When quantitative qu ...

IEEE2023

Distributed Shadow Dynamic Consensus Optimization Framework for Power Market with Parameterization Bidding Strategy of GENCOs

Liying Yu, Sidi-Rachid Cherkaoui

This paper presents a distributed shadow dynamic consensus (DSDC) framework to address the generation company (GENCO) strategic bidding problem in the independent system operator (ISO) operation. First, each sub-group is defined according to the communicat ...

IEEE2023

Filter-Informed Spectral Graph Wavelet Networks for Multiscale Feature Extraction and Intelligent Fault Diagnosis

Olga Fink

Intelligent fault diagnosis has been increasingly improved with the evolution of deep learning (DL) approaches. Recently, the emerging graph neural networks (GNNs) have also been introduced in the field of fault diagnosis with the goal to make better use o ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Event-based sampled ECG morphology reconstruction through self-similarity

David Atienza Alonso, Giovanni Ansaloni, Tomas Teijeiro Campo, Silvio Zanoli

Background and Objective: Event-based analog-to-digital converters allow for sparse bio-signal acquisition, enabling local sub-Nyquist sampling frequency. However, aggressive event selection can cause the loss of important bio-markers, not recoverable with ...

2023

TENET: Memory Safe and Fault Tolerant Persistent Transactional Memory

Sanidhya Kashyap, Diyu Zhou

Byte-addressable non-volatile memory (NVM) allows programs to directly access storage using memory interface without going through the expensive conventional storage stack. However, direct access to NVM makes the NVM data vulnerable to software bugs and ha ...

USENIX ASSOC2023

A Stand-Alone Augmented Reality Intervention for Chronic Pain using Embodied Systolic Stimulation

Andrea Serino, Robert Leeb, Oliver Alan Kannape, Skander Mensi, Sylvain Cardin

Chronic pain presents a tremendous personal, societal, and financial burden. Treatment options are often limited to managing symptoms as opposed to treating the causes, and the consequences of pharmacological treatments can be immensely harmful as evidence ...

IEEE2023

Distributed Graph Learning With Smooth Data Priors

Pascal Frossard, Mireille El Gheche, Isabela Cunha Maia Nobre

Graph learning is often a necessary step in processing or representing structured data, when the underlying graph is not given explicitly. Graph learning is generally performed centrally with a full knowledge of the graph signals, namely the data that live ...

IEEE2022

One Fuzz Doesn’t Fit All: Optimizing Directed Fuzzing via Target-tailored Program State Restriction

Mathias Josef Payer

Fuzzing is the de-facto default technique to discover software flaws, randomly testing programs to discover crashing test cases. Yet, a particular scenario may only care about specific code regions (for, e.g., bug reproduction, patch or regression testing) ...

ASSOC COMPUTING MACHINERY2022