Publication
Large occlusion completion using normal maps
Related publications (32)
Scalable constrained optimization
Modern optimization is tasked with handling applications of increasingly large scale, chiefly due to the massive amounts of widely available data and the ever-growing reach of Machine Learning. Consequently, this area of research is under steady pressure t ...
EPFL2024Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints
Colin Neil Jones, Yuning Jiang, Bratislav Svetozarevic, Wenjie Xu
This paper studies the problem of online performance optimization of constrained closed-loop control systems, where both the objective and the constraints are unknown black-box functions affected by exogenous time-varying contextual disturbances. A primal- ...
New York2023On the asymptotic behavior of the solutions to parabolic variational inequalities
We consider various versions of the obstacle and thin-obstacle problems, we interpret them as variational inequalities, with non-smooth constraint, and prove that they satisfy a new constrained Lojasiewicz inequality. The difficulty lies in the fact that, ...
2020Shape Reconstruction by Learning Differentiable Surface Representations
Pascal Fua, Mathieu Salzmann, Shaifali Parashar, Jan Bednarík, Erhan Gündogdu
Generative models that produce point clouds have emerged as a powerful tool to represent 3D surfaces, and the best current ones rely on learning an ensemble of parametric representations. Unfortunately, they offer no control over the deformations of the su ...
2020Non-contact polishing of a crystalline layer or substrate by ion beam etching
Niels Quack, Teodoro Graziosi, Sichen Mi
Polishing method comprising the steps of: - providing at least one crystalline layer or substrate, the at least one crystalline layer or substrate extending in at least one plane, and including at least one outer surface and at least one depression extendi ...
2020Designing Coalition-Proof Reverse Auctions Over Continuous Goods
Maryam Kamgarpour, Orcun Karaca
This paper investigates reverse auctions that involve continuous values of different types of goods, general nonconvex constraints, and second stage costs. We seek to design the payment rules and conditions under which coalitions of participants cannot inf ...
2019Learning Generalized Nash Equilibria in a Class of Convex Games
We consider multiagent decision making where each agent optimizes its convex cost function subject to individual and coupling constraints. The constraint sets are compact convex subsets of a Euclidean space. To learn Nash equilibria, we propose a novel dis ...
2019Modelling Resource Dependencies
Simon Bliudze, Alena Simalatsar, Alina Zolotukhina
The major research in the resource management literature focuses primarily on two directions: 1) specification languages for formulating resource requests and 2) constraint problems modelling allocation and scheduling. Both directions assume the knowledge ...
2016A Dichotomy for Real Weighted Holant Problems
Holant is a framework of counting characterized by local constraints. It is closely related to other well-studied frameworks such as the counting constraint satisfaction problem (#CSP) and graph homomorphism. An effective dichotomy for such frameworks can ...
Springer Basel Ag2016Distributed learning over multitask networks with linearly related tasks
In this work, we consider distributed adaptive learning over multitask mean-square-error (MSE) networks where each agent is interested in estimating its own parameter vector, also called task, and where the tasks at neighboring agents are related according ...
IEEE2016