Publications related to Identifying and Comparing Multi-dimensional Student Profiles Across Flipped Classrooms

Related publications (16)

Learning to Count from Pseudo-Labeled Segmentation

Class-agnostic counting (CAC) has numerous potential applications across various domains. The goal is to count objects of an arbitrary category during testing, based on only a few annotated exemplars. However, existing methods often count all objects in th ...

IEEE2025

Graph sparsification, sketching and adaptivity

Mikhail Makarov

Many challenges of modern graph processing stem from the fact that graphs have become massive and change frequently. Numerous techniques have been developed to address those issues, with graph cut sparsification offering to replace original graphs with th ...

EPFL2025

Future Changes in Dynamics of Extreme Precipitation and Dry Periods in the Swiss Alps and Consequences for Hydropower Production

Tatjana Milojevic

Global climate warming is leading to more frequent and severe extreme weather events, with alpine regions like the European Alps being particularly vulnerable. This thesis explores future changes in extreme weather dynamics in the southeastern Swiss Alps a ...

EPFL2024

Byzantine-Resilient Multi-Agent System

Rachid Guerraoui, Alexandre David Olivier Maurer

We consider the problem of making a multi-agent system (MAS) resilient to Byzantine failures through replication. We consider a very general model of MAS, where randomness can be involved in the behavior of each agent. We propose the first universal scheme ...

IEEE COMPUTER SOC2022

Failure and success of the spectral bias prediction for Laplace Kernel Ridge Regression: the case of low-dimensional data

Matthieu Wyart, Antonio Sclocchi, Umberto Maria Tomasini

Recently, several theories including the replica method made predictions for the generalization error of Kernel Ridge Regression. In some regimes, they predict that the method has a 'spectral bias': decomposing the true function f* on the eigenbasis of the ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Protected Attributes Tell Us Who, Behavior Tells Us How: A Comparison of Demographic and Behavioral Oversampling for Fair Student Success Modeling

Tanja Christina Käser Jacober

Algorithms deployed in education can shape the learning experience and success of a student. It is therefore important to understand whether and how such algorithms might create inequalities or amplify existing biases. In this paper, we analyze the fairnes ...

2022

Matching Seqlets: An Unsupervised Approach for Locality Preserving Sequence Matching

Pascal Fua, Xinchao Wang

In this paper, we propose a novel unsupervised approach for sequence matching by explicitly accounting for the locality properties in the sequences. In contrast to conventional approaches that rely on frame-to-frame matching, we conduct matching using sequ ...

2021

Global Free-Energy Landscapes as a Smoothly Joined Collection of Local Maps

Michele Ceriotti, Federico Giberti

Enhanced sampling techniques have become an essential tool in computational chemistry and physics, where they are applied to sample activated processes that occur on a time scale that is inaccessible to conventional simulations. Despite their popularity, i ...

2021

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Justin Dean Ward

Clustering is a classic topic in optimization with k-means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best-known algorithm for k-means in Euclidean space with a provable guarantee is a simple local ...

SIAM PUBLICATIONS2020

Graph Laplacian Mixture Model

Pascal Frossard, Hermina Petric Maretic

Graph learning methods have recently been receiving increasing interest as means to infer structure in datasets. Most of the recent approaches focus on different relationships between a graph and data sample distributions, mostly in settings where all avai ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Fair Colorful k-Center Clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius ρ such that there exist balls of radius ρ around ...

Springer2020

Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences

Anastasios Kyrillidis

Many natural and man-made signals can be described as having a few degrees of freedom relative to their size due to natural parameterizations or constraints; examples include bandlimited signals, collections of signals observed from multiple viewpoints in ...

EPFL2014

Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Relationships between entities in datasets are often of multiple types, which can naturally be modeled by a multi-layer graph; a common vertex set represents the entities and the edges on different layers capture different types of relationships between th ...

2013

A methodology for creating sequential multi-period base-case scenarios for large data sets

François Maréchal, Laurent Gabriel Félix Alexandre Stéphane Bungener, Greta Martha Van Eetvelde

Key performance indicators in engineering problems include but are not limited to financial, operational, management and environmental factors, which are significantly affected by aspects such as seasonality, fouling, economic climate, production rates, su ...

AIDIC Servizi2013

Computing the size and number of neuronal clusters in local circuits

Henry Markram, Rodrigo de Campos Perin

The organization of connectivity in neuronal networks is fundamental to understanding the activity and function of neural networks and information processing in the brain. Recent studies show that the neocortex is not only organized in columns and layers b ...

Frontiers Research Foundation2013

Structural cluster analysis of chemical reactions in solution

Fabio Pietrucci

We introduce a simple and general approach to the problem of clustering structures from atomic trajectories of chemical reactions in solution. By considering distance metrics which are invariant under permutation of identical atoms or molecules, we demonst ...

Amer Inst Physics2013