Let k be a field, and let L be an etale k-algebra of finite rank. If a is an element of k(x), let X-a be the affine variety defined by N-L/k(x) = a. Assuming that L has at least one factor that is a cyclic field extension of k, we give a combinatorial desc ...
We propose a structured prediction approach for robot imitation learning from demonstrations. Among various tools for robot imitation learning, supervised learning has been observed to have a prominent role. Structured prediction is a form of supervised le ...
Time has always been a central factor in understanding the challenges of daily mobility. For a long time, and still today, methods of economic evaluation of transport projects have monetized time savings so that they can be included in the cost–benefit ana ...
In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...
We study the problem of estimating an unknown function from noisy data using shallow ReLU neural networks. The estimators we study minimize the sum of squared data-fitting errors plus a regularization term proportional to the squared Euclidean norm of the ...
A Muon Spin Rotation (mu+SR) study was conducted to investigate the magnetic properties of SrCu2(BO3)(2) (SCBO) as a function of temperature/pressure. Measurements in zero field and transverse field confirm the absence of long range magnetic order at high ...
We address the problem of stably and efficiently training a deep neural network robust to adversarial perturbations bounded by an l1 norm. We demonstrate that achieving robustness against l1-bounded perturbations is more challenging than in the l2 ...
