Caching (Bivariate) Gaussians

About
Privacy
Disclaimer

Graph Chatbot

Related publications (30)

Universal and adaptive methods for robust stochastic optimization

Within the context of contemporary machine learning problems, efficiency of optimization process depends on the properties of the model and the nature of the data available, which poses a significant problem as the complexity of either increases ad infinit ...

EPFL2023

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Prompting Large Language Models to Power Educational Chatbots

Denis Gillet, Sandy Ingram, Juan Carlos Farah, Fanny Kim-Lan Lasne

The recent rise in both popularity and performance of large language models has garnered considerable interest regarding their applicability to education. Technologies like ChatGPT, which can engage in human-like dialog, have already disrupted educational ...

Springer2023

Rebooting Virtual Memory with Midgard

Siddharth Gupta

Virtual Memory (VM) is a critical programming abstraction that is widely used in various modern computing platforms. With the rise of datacenter computing and birth of planet-scale online services, the semantic and capacity requirements from memory have ev ...

EPFL2023

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Michel Bierlaire

In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...

2023

Safe Zeroth-Order Convex Optimization Using Quadratic Local Approximations

Baiwei Guo, Giancarlo Ferrari Trecate, Yuning Jiang, Maryam Kamgarpour

We address black-box convex optimization problems, where the objective and constraint functions are not explicitly known but can be sampled within the feasible set. The challenge is thus to generate a sequence of feasible points converging towards an optim ...

IEEE2023

Generalizing Bulk-Synchronous Parallel Processing for Data Science: From Data to Threads and Agent-Based Simulations

Zilu Tian

Agent-based simulations have been widely applied in many disciplines, by scientists and engineers alike. Scientists use agent-based simulations to tackle global problems, including alleviating poverty, reducing violence, and predicting the impact of pandem ...

EPFL2023

Creating Trust by Abolishing Hierarchies

Adrien Ghosn, Edouard Bugnion, Evangelos Marios Kogias, Mathias Josef Payer, Charly Nicolas Lucien Castes, Yuchen Qian, Neelu Shivprakash Kalani

Software is going through a trust crisis. Privileged code is no longer trusted and processes insufficiently protect user code from unverified libraries. While usually treated separately, confidential computing and program compartmentalization are both symp ...

Association for Computing Machinery2023

The Case for Performance Interfaces for Hardware Accelerators

George Candea, Aikaterini Argyraki, Rishabh Ramesh Iyer, Jiacheng Ma

While systems designers are increasingly turning to hardware accelerators for performance gains, realizing these gains is painstaking and error-prone. It can take several person-months to determine if a given accelerator is a good fit for a given piece of ...

2023

lifex-ep: a robust and efficient software for cardiac electrophysiology simulations

Alfio Quarteroni, Francesco Regazzoni, Marco Fedele, Stefano Pagani

Background: Simulating the cardiac function requires the numerical solution of multi-physics and multi-scale mathematical models. This underscores the need for streamlined, accurate, and high-performance computational tools. Despite the dedicated endeavors ...

BMC2023

Page 2 of 2