Miracle-dz/UniFAR-FTUs huggingface dataset:
Instance-Level Task Parameters: A Robust Multi-task Weighting Framework

Recent works have shown that deep neural networks benefit from multi-task learning by learning a shared representation across several related tasks. However, performance of such systems depend on relative weighting between various losses involved during training. Prior works on loss weighting schemes assume that instances are equally easy or hard for all tasks. In order to break this assumption, we let the training process dictate the optimal weighting of tasks for every instance in the dataset. More specifically, we equip every instance in the dataset with a set of learnable parameters (instance-level task parameters) where the cardinality is equal to the number of tasks learned by the model. These parameters model the weighting of each task for an instance. They are updated by gradient descent and do not require hand-crafted rules. We conduct extensive experiments on SURREAL and CityScapes datasets, for human shape and pose estimation, depth estimation and semantic segmentation tasks. In these tasks, our approach outperforms recent dynamic loss weighting approaches, e.g. reducing surface estimation errors by 8.97% on SURREAL. When applied to datasets where one or more tasks can have noisy annotations, the proposed method learns to prioritize learning from clean labels for a given task, e.g. reducing surface estimation errors by up to 60%. We also show that we can reliably detect corrupt labels for a given task as a by-product from learned instance-level task parameters.
Concurrent goal-oriented materials-by-design

The development of new materials and structures for extreme conditions including impact remains a continuing challenge despite steady advances. Design is currently accomplished using a sequential approach: an optimal material is first developed using the process-structure-properties paradigm, where performance is measured against a blended measure. Then, the structure is optimized while holding the material properties fixed. In this paper, we propose an alternative concurrent and goal-oriented optimization approach where both the material properties and the structure are optimized simultaneously against an overall system-wide performance measure. We develop a non-intrusive, high-performance computational framework based on DAKOTA and GMSH and use it to study the ballistic impact of a double-layer plate of strong AZ31B magnesium alloy and soft polyurea. We show that the proposed concurrent and goaloriented optimization strategy can provide significant advantage over the traditional sequential optimization approach.
Necessary and Sufficient Conditions to Bernstein Theorem of a Hessian Equation

The Hessian quotient equations (0.1) S k,l(D u) ≡ S k(D u) S l(Du) = 1, ∀x ∈ R were studied for k−th symmetric elementary function S k(Du) of eigenvalues λ(Du) of the Hessian matrix Du, where 0 ≤ l < k ≤ n. For l = 0, (0.1) is reduced to a k−Hessian equation (0.2) S k(D u) = 1, ∀x ∈ R. Two quadratic growth conditions were found by Bao-Cheng-Guan-Ji ([1], American J. Math., 2003, 125, 301-316) ensuring the Bernstein properties of (0.1) and (0.2) respectively. In this paper, we will drop the point wise quadratic growth condition of [1] and prove three necessary and sufficient conditions to Bernstein property of (0.1) and (0.2), using a reverse isoperimetric type inequality, volume growth or L-integrable respectively. Our new volume growth or Lp−integrable conditions improve largely various previously known point wise conditions in [1, 6, 7, 14, 21] etc.
FedNLP: An Interpretable NLP System to Decode Federal Reserve Communications

The Federal Reserve System (the Fed) plays a significant role in affecting monetary policy and financial conditions worldwide. Although it is important to analyse the Fed's communications to extract useful information, it is generally long-form and complex due to the ambiguous and esoteric nature of content. In this paper, we present FedNLP, an interpretable multi-component Natural Language Processing (NLP) system to decode Federal Reserve communications. This system is designed for end-users to explore how NLP techniques can assist their holistic understanding of the Fed's communications with NO coding. Behind the scenes, FedNLP uses multiple NLP models from traditional machine learning algorithms to deep neural network architectures in each downstream task. The demonstration shows multiple results at once including sentiment analysis, summary of the document, prediction of the Federal Funds Rate movement and visualization for interpreting the prediction model's result. Our application system and demonstration are available at https://fednlp.net.
Conformal Bayesian Computation

We develop scalable methods for producing conformal Bayesian predictive intervals with finite sample calibration guarantees. Bayesian posterior predictive distributions, $p(y \mid x)$, characterize subjective beliefs on outcomes of interest, $y$, conditional on predictors, $x$. Bayesian prediction is well-calibrated when the model is true, but the predictive intervals may exhibit poor empirical coverage when the model is misspecified, under the so called ${\cal{M}}$-open perspective. In contrast, conformal inference provides finite sample frequentist guarantees on predictive confidence intervals without the requirement of model fidelity. Using 'add-one-in' importance sampling, we show that conformal Bayesian predictive intervals are efficiently obtained from re-weighted posterior samples of model parameters. Our approach contrasts with existing conformal methods that require expensive refitting of models or data-splitting to achieve computational efficiency. We demonstrate the utility on a range of examples including extensions to partially exchangeable settings such as hierarchical models.
Multilevel Spectral Domain Decomposition

Highly heterogeneous, anisotropic coefficients, e.g. in the simulation of carbon-fibre composite components, can lead to extremely challenging finite element systems. Direct solvers for the resulting large and sparse linear systems suffer from severe memory requirements and limited parallel scalability, while iterative solvers in general lack robustness. Two-level spectral domain decomposition methods can provide such robustness for symmetric positive definite linear systems, by using coarse spaces based on independent generalized eigenproblems in the subdomains. Rigorous condition number bounds are independent of mesh size, number of subdomains, as well as coefficient contrast. However, their parallel scalability is still limited by the fact that (in order to guarantee robustness) the coarse problem is solved via a direct method. In this paper, we introduce a multilevel variant in the context of subspace correction methods and provide a general convergence theory for its robust convergence for abstract, elliptic variational problems. Assumptions of the theory are verified for conforming, as well as for discontinuous Galerkin methods applied to a scalar diffusion problem. Numerical results illustrate the performance of the method for two- and three-dimensional problems and for various discretization schemes, in the context of scalar diffusion and linear elasticity.
Tests of the Porter-Thomas Distribution for Reduced Partial Neutron Widths

Given N data points drawn from a χ-distribution, we use Bayesian inference to determine most likely values and N-dependent confidence intervals for the width σ and the number k of degrees of freedom of that distribution. Using reduced partial neutron widths measured in a number of nuclei, a guessed value of σ, and a maximum-likelihood approach (different from Bayesian inference), Koehler et al. [1] and Koehler [2] have determined the most likely k-values of χ-distributions that fit the data. In all cases they find values for k that differ substantially from k = 1 (the value characterizing the Porter-Thomas distribution (PTD) predicted by random-matrix theory). The authors conclude that the validity of the PTD must be rejected with considerable statistical significance. We show that the value of σ guessed in Refs. [1, 2] lies far outside the Bayesian confidence interval for σ, casting serious doubt on the results of and the conclusions drawn in Refs. [1, 2]. We also show that σ and k must both be determined from the data. Comparison of the results with the Bayesian confidence intervals would then decide on acceptance or rejection of the PTD.
On dimension-dependent concentration for convex Lipschitz functions in product spaces

Let $n\geq 1$, $K>0$, and let $X=(X_1,X_2,\dots,X_n)$ be a random vector in $\mathbb{R}^n$ with independent $K$--subgaussian components. We show that for every $1$--Lipschitz convex function $f$ in $\mathbb{R}^n$ (the Lipschitzness with respect to the Euclidean metric), $$ \max\big(\mathbb{P}\big\{f(X)-{\rm Med}\,f(X)\geq t\big\},\mathbb{P}\big\{f(X)-{\rm Med}\,f(X)\leq -t\big\}\big)\leq \exp\bigg( -\frac{c\,t^2}{K^2\log\big(2+\frac{ n}{t^2/K^2}\big)}\bigg),\quad t>0, $$ where $c>0$ is a universal constant. The estimates are optimal in the sense that for every $n\geq \tilde C$ and $t>0$ there exist a product probability distribution $X$ in $\mathbb{R}^n$ with $K$--subgaussian components, and a $1$--Lipschitz convex function $f$, with $$ \mathbb{P}\big\{\big|f(X)-{\rm Med}\,f(X)\big|\geq t\big\}\geq \tilde c\,\exp\bigg( -\frac{\tilde C\,t^2}{K^2\log\big(2+\frac{n}{t^2/K^2}\big)}\bigg). $$ The obtained deviation estimates for subgaussian variables are in sharp contrast with the case of variables with bounded $\|X_i\|_{\psi_p}$--norms for $p\in[1,2)$.
Towards Understanding Generalization via Decomposing Excess Risk Dynamics

Generalization is one of the fundamental issues in machine learning. However, traditional techniques like uniform convergence may be unable to explain generalization under overparameterization. As alternative approaches, techniques based on stability analyze the training dynamics and derive algorithm-dependent generalization bounds. Unfortunately, the stability-based bounds are still far from explaining the surprising generalization in deep learning since neural networks usually suffer from unsatisfactory stability. This paper proposes a novel decomposition framework to improve the stability-based bounds via a more fine-grained analysis of the signal and noise, inspired by the observation that neural networks converge relatively slowly when fitting noise (which indicates better stability). Concretely, we decompose the excess risk dynamics and apply the stability-based bound only on the noise component. The decomposition framework performs well in both linear regimes (overparameterized linear regression) and non-linear regimes (diagonal matrix recovery). Experiments on neural networks verify the utility of the decomposition framework.
Autonomous Fire Fighting with a UAV-UGV Team at MBZIRC 2020

Every day, burning buildings threaten the lives of occupants and first responders trying to save them. Quick action is of essence, but some areas might not be accessible or too dangerous to enter. Robotic systems have become a promising addition to firefighting, but at this stage, they are mostly manually controlled, which is error-prone and requires specially trained personal. We present two systems for autonomous firefighting from air and ground we developed for the Mohamed Bin Zayed International Robotics Challenge (MBZIRC) 2020. The systems use LiDAR for reliable localization within narrow, potentially GNSS-restricted environments while maneuvering close to obstacles. Measurements from LiDAR and thermal cameras are fused to track fires, while relative navigation ensures successful extinguishing. We analyze and discuss our successful participation during the MBZIRC 2020, present further experiments, and provide insights into our lessons learned from the competition.
Small Object Detection for Near Real-Time Egocentric Perception in a Manual Assembly Scenario

Detecting small objects in video streams of head-worn augmented reality devices in near real-time is a huge challenge: training data is typically scarce, the input video stream can be of limited quality, and small objects are notoriously hard to detect. In industrial scenarios, however, it is often possible to leverage contextual knowledge for the detection of small objects. Furthermore, CAD data of objects are typically available and can be used to generate synthetic training data. We describe a near real-time small object detection pipeline for egocentric perception in a manual assembly scenario: We generate a training data set based on CAD data and realistic backgrounds in Unity. We then train a YOLOv4 model for a two-stage detection process: First, the context is recognized, then the small object of interest is detected. We evaluate our pipeline on the augmented reality device Microsoft Hololens 2.
Model-Free Learning for Two-Player Zero-Sum Partially Observable Markov Games with Perfect Recall

We study the problem of learning a Nash equilibrium (NE) in an imperfect information game (IIG) through self-play. Precisely, we focus on two-player, zero-sum, episodic, tabular IIG under the perfect-recall assumption where the only feedback is realizations of the game (bandit feedback). In particular, the dynamic of the IIG is not known -- we can only access it by sampling or interacting with a game simulator. For this learning setting, we provide the Implicit Exploration Online Mirror Descent (IXOMD) algorithm. It is a model-free algorithm with a high-probability bound on the convergence rate to the NE of order $1/\sqrt{T}$ where $T$ is the number of played games. Moreover, IXOMD is computationally efficient as it needs to perform the updates only along the sampled trajectory.
Excitation of a homogeneous dielectric sphere by a point electric dipole

Electrically small dielectric antennas are of great interest for modern technologies, since they can significantly reduce the physical size of electronic devices for processing and transmitting information. We investigate the influence of the resonance conditions of an electrically small dielectric spherical antenna with a high refractive index on its directivity and analyze the dependence of these resonances on the effectively excited modes of the dielectric sphere.
How Should Agents Ask Questions For Situated Learning? An Annotated Dialogue Corpus

Intelligent agents that are confronted with novel concepts in situated environments will need to ask their human teammates questions to learn about the physical world. To better understand this problem, we need data about asking questions in situated task-based interactions. To this end, we present the Human-Robot Dialogue Learning (HuRDL) Corpus - a novel dialogue corpus collected in an online interactive virtual environment in which human participants play the role of a robot performing a collaborative tool-organization task. We describe the corpus data and a corresponding annotation scheme to offer insight into the form and content of questions that humans ask to facilitate learning in a situated environment. We provide the corpus as an empirically-grounded resource for improving question generation in situated intelligent agents.
DG-LMC: A Turn-key and Scalable Synchronous Distributed MCMC Algorithm

Performing reliable Bayesian inference on a big data scale is becoming a keystone in the modern era of machine learning. A workhorse class of methods to achieve this task are Markov chain Monte Carlo (MCMC) algorithms and their design to handle distributed datasets has been the subject of many works. However, existing methods are not completely either reliable or computationally efficient. In this paper, we propose to fill this gap in the case where the dataset is partitioned and stored on computing nodes within a cluster under a master/slaves architecture. We derive a user-friendly centralised distributed MCMC algorithm with provable scaling in high-dimensional settings. We illustrate the relevance of the proposed methodology on both synthetic and real data experiments.
N-Best ASR Transformer: Enhancing SLU Performance using Multiple ASR Hypotheses

Spoken Language Understanding (SLU) systems parse speech into semantic structures like dialog acts and slots. This involves the use of an Automatic Speech Recognizer (ASR) to transcribe speech into multiple text alternatives (hypotheses). Transcription errors, ordinary in ASRs, impact downstream SLU performance negatively. Common approaches to mitigate such errors involve using richer information from the ASR, either in form of N-best hypotheses or word-lattices. We hypothesize that transformer models will learn better with a simpler utterance representation using the concatenation of the N-best ASR alternatives, where each alternative is separated by a special delimiter [SEP]. In our work, we test our hypothesis by using the concatenated N-best ASR alternatives as the input to the transformer encoder models, namely BERT and XLM-RoBERTa, and achieve equivalent performance to the prior state-of-the-art model on DSTC2 dataset. We also show that our approach significantly outperforms the prior state-of-the-art when subjected to the low data regime. Additionally, this methodology is accessible to users of third-party ASR APIs which do not provide word-lattice information.
Catch-A-Waveform: Learning to Generate Audio from a Single Short Example

Models for audio generation are typically trained on hours of recordings. Here, we illustrate that capturing the essence of an audio source is typically possible from as little as a few tens of seconds from a single training signal. Specifically, we present a GAN-based generative model that can be trained on one short audio signal from any domain (e.g. speech, music, etc.) and does not require pre-training or any other form of external supervision. Once trained, our model can generate random samples of arbitrary duration that maintain semantic similarity to the training waveform, yet exhibit new compositions of its audio primitives. This enables a long line of interesting applications, including generating new jazz improvisations or new a-cappella rap variants based on a single short example, producing coherent modifications to famous songs (e.g. adding a new verse to a Beatles song based solely on the original recording), filling-in of missing parts (inpainting), extending the bandwidth of a speech signal (super-resolution), and enhancing old recordings without access to any clean training example. We show that in all cases, no more than 20 seconds of training audio commonly suffice for our model to achieve state-of-the-art results. This is despite its complete lack of prior knowledge about the nature of audio signals in general.
Demystifying Assumptions in Learning to Discover Novel Classes

In learning to discover novel classes (L2DNC), we are given labeled data from seen classes and unlabeled data from unseen classes, and we train clustering models for the unseen classes. However, the rigorous deﬁnition of L2DNC is unexplored , which results in that its implicit assumptions are still unclear . In this paper, we demystify assumptions behind L2DNC and ﬁnd that high-level semantic features should be shared among the seen and unseen classes. This naturally motivates us to link L2DNC to meta-learning that has exactly the same assumption as L2DNC. Based on this ﬁnding, L2DNC is not only theoretically solvable, but can also be empirically solved by meta-learning algorithms after slight modiﬁcations. This L2DNC methodology signiﬁcantly reduces the amount of unlabeled data needed for training and makes it more practical, as demonstrated in experiments. The use of very limited data is also justiﬁed by the application scenario of L2DNC: since it is unnatural to label only seen-class data, L2DNC is sampling instead of labeling in causality. Therefore, unseen-class data should be collected on the way of collecting seen-class data, which is why they are novel and ﬁrst need to be clustered.
The Complexity of Sparse Tensor PCA

We study the problem of sparse tensor principal component analysis: given a tensor $\pmb Y = \pmb W + \lambda x^{\otimes p}$ with $\pmb W \in \otimes^p\mathbb{R}^n$ having i.i. d. Gaussian entries, the goal is to recover the $k$-sparse unit vector $x \in \mathbb{R}^n$. The model captures both sparse PCA (in its Wigner form) and tensor PCA. For the highly sparse regime of $k \leq \sqrt{n}$, we present a family of algorithms that smoothly interpolates between a simple polynomial-time algorithm and the exponential-time exhaustive search algorithm. For any $1 \leq t \leq k$, our algorithms recovers the sparse vector for signal-to-noise ratio $\lambda \geq \tilde{\mathcal{O}} (\sqrt{t} \cdot (k/t)^{p/2})$ in time $\tilde{\mathcal{O}}(n^{p+t})$, capturing the state-of-the-art guarantees for the matrix settings (in both the polynomial-time and sub-exponential time regimes). Our results naturally extend to the case of $r$ distinct $k$-sparse signals with disjoint supports, with guarantees that are independent of the number of spikes. Even in the restricted case of sparse PCA, known algorithms only recover the sparse vectors for $\lambda \geq \tilde{\mathcal{O}}(k \cdot r)$ while our algorithms require $\lambda \geq \tilde{\mathcal{O}}(k)$. Finally, by analyzing the low-degree likelihood ratio, we complement these algorithmic results with rigorous evidence illustrating the trade-offs between signal-to-noise ratio and running time. This lower bound captures the known lower bounds for both sparse PCA and tensor PCA. In this general model, we observe a more intricate three-way trade-off between the number of samples $n$, the sparsity $k$, and the tensor power $p$.
Vacuum instability in time-dependent electric fields: New example of an exactly solvable case

A new exactly solvable case in strong-field quantum electrodynamics with a time-dependent external electric field is presented. The corresponding field is given by one component of the electromagnetic vector potential, which is the analytic function Ax (t) = σE0 [1 + exp (t/σ)] −1/2, where σ is a time-scale parameter. In contrast to Sauter-like electric field, this field is asymmetric with respect to the time instant, where it reaches its maximum value, that is why we call it the analytic asymmetric electric field. We managed to exactly solve the Dirac equation with such a field, which made it possible to calculate characteristics of the corresponding vacuum instability nonperturbatively. We construct the so-called inand out-solutions and with their help calculate mean differential and total numbers of created charged particles, probability of the vacuum to remain a vacuum, vacuum mean values of current density and energy-momentum tensor of the particles. We study the ∗breev@mail.tsu. ru †gavrilovsergeyp@yahoo.com ‡dmitrygitman@hotmail.com §a.a. shishmarev@mail.ru 1 ar X iv :2 10 6. 06 32 2v 1 [ he pth ] 1 1 Ju n 20 21 vacuum instability in regimes of rapidly and slowly changing analytic asymmetric electric field, and compare the obtained results with corresponding ones obtained earlier for the case of the symmetric Sauter-like electric field. We also compare exact results in the regime of slowly changing field with corresponding results obtained within the slowly varying field approximation proposed by two of the authors in PRD 95, 076013 (2017), thus demonstrating the effectiveness of such an approximation.