Miracle-dz/UniFAR-FTUs huggingface dataset:
What Makes an Image Tagger Fair?

Image analysis algorithms have been a boon to personalization in digital systems and are now widely available via easy-to-use APIs. However, it is important to ensure that they behave fairly in applications that involve processing images of people, such as dating apps. We conduct an experiment to shed light on the factors influencing the perception of "fairness. " Participants are shown a photo along with two descriptions (human- and algorithm-generated). They are then asked to indicate which is "more fair" in the context of a dating site, and explain their reasoning. We vary a number of factors, including the gender, race and attractiveness of the person in the photo. While participants generally found human-generated tags to be more fair, API tags were judged as being more fair in one setting - where the image depicted an "attractive," white individual. In their explanations, participants often mention accuracy, as well as the objectivity/subjectivity of the tags in the description. We relate our work to the ongoing conversation about fairness in opaque tools like image tagging APIs, and their potential to result in harm.
Embedding Imputation with Grounded Language Information

Due to the ubiquitous use of embeddings as input representations for a wide range of natural language tasks, imputation of embeddings for rare and unseen words is a critical problem in language processing. Embedding imputation involves learning representations for rare or unseen words during the training of an embedding model, often in a post-hoc manner. In this paper, we propose an approach for embedding imputation which uses grounded information in the form of a knowledge graph. This is in contrast to existing approaches which typically make use of vector space properties or subword information. We propose an online method to construct a graph from grounded information and design an algorithm to map from the resulting graphical structure to the space of the pre-trained embeddings. Finally, we evaluate our approach on a range of rare and unseen word tasks across various domains and show that our model can learn better representations. For example, on the Card-660 task our method improves Pearson’s and Spearman’s correlation coefficients upon the state-of-the-art by 11% and 17.8% respectively using GloVe embeddings.
Reliable training and estimation of variance networks

We propose and investigate new complementary methodologies for estimating predictive variance networks in regression neural networks. We derive a locally aware mini-batching scheme that result in sparse robust gradients, and show how to make unbiased weight updates to a variance network. Further, we formulate a heuristic for robustly fitting both the mean and variance networks post hoc. Finally, we take inspiration from posterior Gaussian processes and propose a network architecture with similar extrapolation properties to Gaussian processes. The proposed methodologies are complementary, and improve upon baseline methods individually. Experimentally, we investigate the impact on predictive uncertainty on multiple datasets and tasks ranging from regression, active learning and generative modeling. Experiments consistently show significant improvements in predictive uncertainty estimation over state-of-the-art methods across tasks and datasets.
Multi-objects Generation with Amortized Structural Regularization

Deep generative models (DGMs) have shown promise in image generation. However, most of the existing work learn the model by simply optimizing a divergence between the marginal distributions of the model and the data, and often fail to capture the rich structures and relations in multi-object images. Human knowledge is a critical element to the success of DGMs to infer these structures. In this paper, we propose the amortized structural regularization (ASR) framework, which adopts the posterior regularization (PR) to embed human knowledge into DGMs via a set of structural constraints. We derive a lower bound of the regularized log-likelihood, which can be jointly optimized with respect to the generative model and recognition model efficiently. Empirical results show that ASR significantly outperforms the DGM baselines in terms of inference accuracy and sample quality.
Increasing Transparent and Accountable Use of Data by Quantifying the Actual Privacy Risk in Interactive Record Linkage

Record linkage refers to the task of integrating data from two or more databases without a common identifier. MINDFIRL (MInimum Necessary Disclosure For Interactive Record Linkage) is a software system that demonstrates the tradeoff between utility and privacy in interactive record linkage. Due to the need to access personally identifiable information (PII) to accurately assess whether different records refer to the same person in heterogeneous databases, privacy is a major concern in interactive record linkage. MINDFIRL supports interactive record linkage while minimizing the privacy risk by (1) using pseudonyms to separate the identifying information from the sensitive information, (2) dynamically disclosing only the minimum necessary information incrementally, as needed on-demand at the point of decision, and (3) quantifies the risk due to the needed information disclosure to support transparency, the reasoning, communication, and decisions on the privacy and utility trade off. In this paper we present an overview of the MINDFIRL system and the k-Anonymized Privacy Risk (KAPR) score used to measure the privacy risk based on the disclosed information. We prove that KAPR score is a norm meeting all the desirable properties for a risk score for interactive record linkage.
Intelligent Reflecting Surface Versus Decode-and-Forward: How Large Surfaces are Needed to Beat Relaying?

The rate and energy efficiency of wireless channels can be improved by deploying software-controlled metasurfaces to reflect signals from the source to the destination, especially when the direct path is weak. While previous works mainly optimized the reflections, this letter compares the new technology with classic decode-and-forward (DF) relaying. The main observation is that very high rates and/or large metasurfaces are needed to outperform DF relaying, both in terms of minimizing the total transmit power and maximizing the energy efficiency, which also includes the dissipation in the transceiver hardware.
Peristaltic locomotion without digital controllers: Exploiting the origami multi-stability to coordinate robotic motions

This study proposes and examines a novel approach to generate peristaltic-like locomotion in a segmented origami robot. Specifically, we demonstrate the use of multi-stability embedded in origami skeleton to eliminate the need for multiple actuators or digital controllers to coordinate the complex robotic movements in peristaltic crawling. The crawling robot in this study consists of two serially connected bistable origami segments, each featuring a generalized Kresling design and a foldable anchoring mechanism. Mechanics analysis and experimental testing of this dual-segment module reveal a deterministic deformation sequence or actuation cycle, which is then used to generate the different phases in a peristaltic-like locomotion gait. Instead of individually controlling the segment deformation like in earthworm and other crawling robots, we only control the total length of this robot. Therefore, this approach can significantly reduce the total number of actuators needed for locomotion and simplify the control requirements. Moreover, the richness in Kresling origami design offers us substantial freedom to tailor the locomotion performance. Results of this study will contribute to a paradigm shift in how we can use the mechanics of multi-stability for robotic actuation and control.
Crypto Art: A Decentralized View

Abstract Crypto art is limited-edition digital art, cryptographically registered with a token on a blockchain. Tokens represent a transparent, auditable origin and provenance for a piece of digital art. Blockchain technology allows tokens to be held and securely traded without the involvement of third parties. Crypto art draws its origins from conceptual art—sharing the immaterial and distributive nature of artworks, the tight blending of artworks with currency and the rejection of conventional art markets and institutions. The authors propose a collection of viewpoints on crypto art from different actors within the system: artists, collectors, gallerists, art historians and data scientists. A set of emerging themes and open challenges surfaces.
Cross-View Semantic Segmentation for Sensing Surroundings

Sensing surroundings plays a crucial role in human spatial perception, as it extracts the spatial configuration of objects as well as the free space from the observations. To facilitate the robot perception with such a surrounding sensing capability, we introduce a novel visual task called Cross-view Semantic Segmentation as well as a framework named View Parsing Network (VPN) to address it. In the cross-view semantic segmentation task, the agent is trained to parse the first-view observations into a top-down-view semantic map indicating the spatial location of all the objects at pixel-level. The main issue of this task is that we lack the real-world annotations of top-down-view data. To mitigate this, we train the VPN in 3D graphics environment and utilize the domain adaptation technique to transfer it to handle real-world data. We evaluate our VPN on both synthetic and real-world agents. The experimental results show that our model can effectively make use of the information from different views and multi-modalities to understanding spatial information. Our further experiment on a LoCoBot robot shows that our model enables the surrounding sensing capability from 2D image input. Code and demo videos can be found at https://view-parsing-network.github. io.
Termodin\'amica de agujeros negros y campos escalares

Since the descovery by Stephen Hawking that black holes emit radiation in the context of the semiclassical approach to gravity, the black hole thermodynamics has become an active field of research in theoretical physics. In this thesis, the influence of scalar fields on the black hole thermodynamics in $D=4$ dimensions is studied. On one hand, the role played by scalar fields in the first law of black hole thermodynamics is elucidated, by using the quasilocal formalism of Brown and York, which is based on a correct variational principle, and some concrete examples are provided. On the other, the thermodynamic stability of asymptotically flat charged hairy black hole exact solutions is analysed. The solutions considered have a non-trivial scalar field potential and they can be embebbed in supergravity theories. It is explicitly shown that these solutions contain thermodynamically stable black holes.
Visual Backpropagation

We show how a declarative functional programming specification of backpropagation yields a visual and transparent implementation within spreadsheets. We call our method Visual Backpropagation. This backpropagation implementation exploits array worksheet formulas, manual calculation, and has a sequential order of computation similar to the processing of a systolic array. The implementation uses no hidden macros nor user-defined functions; there are no loops, assignment statements, or links to any procedural programs written in conventional languages. As an illustration, we compare a Visual Backpropagation solution to a Tensorflow (Python) solution on a standard regression problem.
Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices

We study the Unadjusted Langevin Algorithm (ULA) for sampling from a probability distribution $\nu = e^{-f}$ on $\mathbb{R}^n$. We prove a convergence guarantee in Kullback-Leibler (KL) divergence assuming $\nu$ satisfies a log-Sobolev inequality and the Hessian of $f$ is bounded. Notably, we do not assume convexity or bounds on higher derivatives. We also prove convergence guarantees in Renyi divergence of order $q > 1$ assuming the limit of ULA satisfies either the log-Sobolev or Poincare inequality.
RadioGAN – Translations between different radio surveys with generative adversarial networks

Radio surveys are widely used to study active galactic nuclei. Radio interferometric observations typically trade-off surface brightness sensitivity for angular resolution. Hence, observations using a wide range of baseline lengths are required to recover both bright small-scale structures and diffuse extended emission. We investigate if generative adversarial networks (GANs) can extract additional information from radio data and might ultimately recover extended flux from a survey with a high angular resolution and vice versa. We use a GAN for the image-to-image translation between two different data sets, namely the Faint Images of the Radio Sky at Twenty-Centimeters (FIRST) and the NRAO VLA Sky Survey (NVSS) radio surveys. The GAN is trained to generate the corresponding image cutout from the other survey for a given input. The results are analyzed with a variety of metrics, including structural similarity as well as flux and size comparison of the extracted sources. RadioGAN is able to recover extended flux density within a $20\%$ margin for almost half of the sources and learns more complex relations between sources in the two surveys than simply convolving them with a different synthesized beam. RadioGAN is also able to achieve subbeam resolution by recognizing complicated underlying structures from unresolved sources. RadioGAN generates over a third of the sources within a $20\%$ deviation from both original size and flux for the FIRST to NVSS translation, while for the NVSS to FIRST mapping it achieves almost $30\%$ within this range.
Degrees of Freedom Analysis of Unrolled Neural Networks

Unrolled neural networks emerged recently as an effective model for learning inverse maps appearing in image restoration tasks. However, their generalization risk (i.e., test mean-squared-error) and its link to network design and train sample size remains mysterious. Leveraging the Stein's Unbiased Risk Estimator (SURE), this paper analyzes the generalization risk with its bias and variance components for recurrent unrolled networks. We particularly investigate the degrees-of-freedom (DOF) component of SURE, trace of the end-to-end network Jacobian, to quantify the prediction variance. We prove that DOF is well-approximated by the weighted \textit{path sparsity} of the network under incoherence conditions on the trained weights. Empirically, we examine the SURE components as a function of train sample size for both recurrent and non-recurrent (with many more parameters) unrolled networks. Our key observations indicate that: 1) DOF increases with train sample size and converges to the generalization risk for both recurrent and non-recurrent schemes; 2) recurrent network converges significantly faster (with less train samples) compared with non-recurrent scheme, hence recurrence serves as a regularization for low sample size regimes.
Hidden Convexity in the l0 Pseudonorm

The so-called l0 pseudonorm counts the number of nonzero components of a vector of a Euclidian space. It is well-known that the l0 pseudonorm is not convex, as its Fenchel biconjugate is zero. In this paper, we introduce a suitable conjugacy, induced by a novel coupling, E-Capra, that has the property of being constant along primal rays like the l0 pseudonorm. The coupling E-Capra belongs to the class of one-sided linear couplings, that we introduce; we show that they induce conjugacies that share nice properties with the classic Fenchel conjugacy. For the E-Capra conjugacy, induced by the coupling E-Capra, we relate the E-Capra conjugate and biconjugate of the l0 pseudonorm, the characteristic functions of its level sets and the sequence of so-called top-k norms. In particular, we prove that the l0 pseudonorm is equal to its biconjugate: hence, the l0 pseudonorm is E-Capra-convex in the sense of generalized convexity. As a corollary, we show that there exists a proper convex lower semicontinuous function such that this function and the l0 pseudonorm coincide on the Euclidian unit sphere. This hidden convexity property is somewhat surprising as the l0 pseudonorm is a highly nonconvex function of combinatorial nature. We provide different expressions for this proper convex lower semicontinuous function, and we give explicit formulas in the two-dimensional case.
Aggregation of pairwise comparisons with reduction of biases

We study the problem of ranking from crowdsourced pairwise comparisons. Answers to pairwise tasks are known to be affected by the position of items on the screen, however, previous models for aggregation of pairwise comparisons do not focus on modeling such kind of biases. We introduce a new aggregation model factorBT for pairwise comparisons, which accounts for certain factors of pairwise tasks that are known to be irrelevant to the result of comparisons but may affect workers' answers due to perceptual reasons. By modeling biases that influence workers, factorBT is able to reduce the effect of biased pairwise comparisons on the resulted ranking. Our empirical studies on real-world data sets showed that factorBT produces more accurate ranking from crowdsourced pairwise comparisons than previously established models.
Linear dimension reduction approximately preserving a function of the 1-norm

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are not too close, the distance between their images is a strictly concave increasing function of their original distance, up to multiplicative error. The target dimension $k$ need only be quadratic in the logarithm of the size of the point set to ensure the result holds with high probability. The linear embeddings are random matrices composed of standard Cauchy random variables, and the proofs rely on Chernoff bounds for sums of iid random variables. The new metric is translation invariant, but is not induced by a norm.
Structural Decompositions for End-to-End Relighting

Relighting is an essential step in artificially transferring an object from one image into another environment. For example, a believable teleconference in Augmented Reality requires a portrait recorded in the source environment to be displayed and relit consistent with the light configuration of the destination scene. In this paper, we investigate architectures for learning to both de-light and relight an image of a human face end-to-end. The architectures vary in how much they enforce physically-based image formation and rendering constraints. The most structured model decomposes the input image into intrinsic components according to a diffuse physics-based image formation model and augments the render to relight including non-diffuse effects. An intermediate model uses fewer intrinsic constraints and the least structured model makes no assumptions on the image formation. To train our models and evaluate the approach, we collected portraits of 21 subjects with various expressions and poses, each in a sequence of 32 individual light sources in a controlled light stage setup. Our method leads to precise and believable relighting results in challenging illumination conditions and poses, including when the subject is facing away from the camera. We compare our method to state-of-the-art relighting approaches and illustrate its superiority in a series of quantitative and qualitative experiments.
IGNITE: A Minimax Game Toward Learning Individual Treatment Effects from Networked Observational Data

Networked observational data presents new opportunities for learning individual causal effects, which plays an indispensable role in decision making. Such data poses the challenge of confounding bias. Previous work presents two desiderata to handle confounding bias. On the treatment group level, we aim to balance the distributions of confounder representations. On the individual level, it is desirable to capture patterns of hidden confounders that predict treatment assignments. Existing methods show the potential of utilizing network information to handle confounding bias, but they only try to satisfy one of the two desiderata. This is because the two desiderata seem to contradict each other. When the two distributions of confounder representations are highly overlapped, then we confront the undiscriminating problem between the treated and the controlled. In this work, we formulate the two desiderata as a minimax game. We propose IGNITE that learns representations of confounders from networked observational data, which is trained by a minimax game to achieve the two desiderata. Experiments verify the efficacy of IGNITE on two datasets under various settings.
Extreme events reveal an alimentary limit on sustained maximal human energy expenditure

Maximum sustained energy expenditure in humans is limited by energy intake and strongly tied to event duration. The limits on maximum sustained energy expenditure are unclear but are of interest because they constrain reproduction, thermoregulation, and physical activity. Here, we show that sustained expenditure in humans, measured as maximum sustained metabolic scope (SusMS), is a function of event duration. We compiled measurements of total energy expenditure (TEE) and basal metabolic rate (BMR) from human endurance events and added new data from adults running ~250 km/week for 20 weeks in a transcontinental race. For events lasting 0.5 to 250+ days, SusMS decreases curvilinearly with event duration, plateauing below 3× BMR. This relationship differs from that of shorter events (e.g., marathons). Incorporating data from overfeeding studies, we find evidence for an alimentary energy supply limit in humans of ~2.5× BMR; greater expenditure requires drawing down the body’s energy stores. Transcontinental race data suggest that humans can partially reduce TEE during long events to extend endurance.
Optimal Task Offloading and Resource Allocation for Fog Computing

We propose a novel multi-tier fog and cloud computing architecture that enables edge nodes to cooperate in sharing computing and radio resources so as to minimize the total energy consumption of mobile users subject to their delay requirements. We first formulate the joint task offloading and resource allocation optimization problem as a mixed integer non-linear programming (MINLP). Due to the combination of binary (offloading decisions) and real variables (resource allocations), the problem is an NP-hard and computationally intractable. To circumvent, we relax the binary decision variables to transform the MINLP to a relaxed optimization problem with real variables. After proving that the relaxed problem is a convex one, we propose three solutions namely ROP, IBBA, and FFBD. In ROP, the solution of the relaxing problem is converted to the integer one and used as the final solution. In IBBA, the branch-and-bound method is combined with different offloading priority policies yielding two variants IBBA-LFC and IBBA-LCF. Note that the branch and bound method like IBBA may require exponential complexity in the worst case. As such, we develop a distributed approach, namely feasibility-finding Benders decomposition (FFBD), that decomposes the original problem into a master problem for the offloading decision and subproblems for resource allocation. These (simpler) subproblems can be solved in parallel at fog nodes, thus help reduce both the complexity and the computational time. FFBD has two different versions (FFBD-S and FFBD-F) is a distributed algorithm based on Benders decomposition. The numerical results show that IBBA-LFC/LCF and FFBD-S/F gain the optimal solution minimizing the total energy consumption and meet all delay requirements for mobile users. The FFBD-F with the fast solution detection method also has the least computation time of four algorithms IBBA-LFC/LCF and FFBD-S/F.