Publications related to Multi-index Stochastic Collocation for random PDEs

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Richard Lee Davis, Engin Walter Bumbacher, Jérôme Guillaume Brender

How to measure students' Computational Problem-Solving (CPS) competencies is an ongoing research topic. Prevalent approaches vary by measurement tools (e.g., interactive programming, multiple-choice tests, or programming-independent tests) and task types ( ...

Association for Computing Machinery2024

SIMPLE HIERARCHICAL PLANNING WITH DIFFUSION

Caglar Gulcehre, Chang Chen

Diffusion-based generative methods have proven effective in modeling trajectories with offline datasets. However, they often face computational challenges and can falter in generalization, especially in capturing temporal abstractions for long- horizon tas ...

2024

Contextual Stochastic Bilevel Optimization

Daniel Kuhn, Andreas Krause, Yifan Hu, Jie Wang

We introduce contextual stochastic bilevel optimization (CSBO) -- a stochastic bilevel optimization framework with the lower-level problem minimizing an expectation conditioned on some contextual information and the upper-level decision variable. This fram ...

2023

Modelling and design of CMOS SPAD sensors for quantum random number generation

Pouyan Keshavarzian

Modern digital connectivity has necessitated the creation of robust methods for securely storing and transferring data. At the heart of all security infrastructure is the random number generator (RNG). While random numbers find use in a variety of applicat ...

EPFL2023

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Total Flow Analysis (TFA) is a method for the worst-case analysis of time-sensitive networks. It uses service curve characterizations of the network nodes and arrival curves of flows at their sources; for tractability, the latter are often taken to be line ...

2023

Attenuated Self-Interference Synchrophasor Estimation: the SOGI Interpolated DFT

Mario Paolone, Cesar Garcia Veloso

In this paper, a synchrophasor estimation (SE) algorithm is presented to simultaneously comply with the requirements for the P and M phasor measurement unit (PMU) performance classes. The method employs a second-order generalized integrator (SOGI) quadratu ...

IEEE2023

Tensor-Based Numerical Method For Stochastic Homogenization

This paper addresses the complexity reduction of stochastic homogenization of a class of random materials for a stationary diffusion equation. A cost-efficient approximation of the correctors is obtained using a method designed to exploit quasi-periodicity ...

SIAM PUBLICATIONS2022

Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems

Volkan Cevher, Thomas Michaelsen Pethick

This paper introduces a new extragradient-type algorithm for a class of nonconvex-nonconcave minimax problems. It is well-known that finding a local solution for general minimax problems is computationally intractable. This observation has recently motivat ...

2022

Increasing Superstructure Optimization Capacity Through Self-Learning Surrogate Models

François Maréchal, Ivan Daniel Kantor, Julia Granacher

Simulation-based optimization models are widely applied to find optimal operating conditions of processes. Often, computational challenges arise from model complexity, making the generation of reliable design solutions difficult. We propose an algorithm fo ...

2021

Multi-index Stochastic Collocation for random PDEs

Graph Chatbot

Chat with Graph Search

Efficient Continual Finite-Sum Minimization

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

SIMPLE HIERARCHICAL PLANNING WITH DIFFUSION

Contextual Stochastic Bilevel Optimization

Modelling and design of CMOS SPAD sensors for quantum random number generation

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

Attenuated Self-Interference Synchrophasor Estimation: the SOGI Interpolated DFT

Tensor-Based Numerical Method For Stochastic Homogenization

Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems

Increasing Superstructure Optimization Capacity Through Self-Learning Surrogate Models

SIMPLE HIERARCHICAL PLANNING WITH DIFFUSION

Contextual Stochastic Bilevel Optimization

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems

Increasing Superstructure Optimization Capacity Through Self-Learning Surrogate Models

Efficient Continual Finite-Sum Minimization

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Tensor-Based Numerical Method For Stochastic Homogenization

Attenuated Self-Interference Synchrophasor Estimation: the SOGI Interpolated DFT

Modelling and design of CMOS SPAD sensors for quantum random number generation