Miracle-dz/UniFAR-FTUs huggingface dataset:
Geometric Relational Embeddings: A Survey

Geometric relational embeddings map relational data as geometric objects that combine vector information suitable for machine learning and structured/relational information for structured/relational reasoning, typically in low dimensions. Their preservation of relational structures and their appealing properties and interpretability have led to their uptake for tasks such as knowledge graph completion, ontology and hierarchy reasoning, logical query answering, and hierarchical multi-label classification. We survey methods that underly geometric relational embeddings and categorize them based on (i) the embedding geometries that are used to represent the data; and (ii) the relational reasoning tasks that they aim to improve. We identify the desired properties (i.e., inductive biases) of each kind of embedding and discuss some potential future work.
Normal Inverse Gaussian Distributions and

The normal inverse Gaussian distribution is defined as a variance-mean mixture of a normal distribution with the inverse Gaussian as the mixing distribution. The distribution determines an homogeneous Levy process, and this process is representable through subordination of Brownian motion by the inverse Gaussian process. The canonical, Levy type, decomposition of the process is determined. As a preparation for developments in the latter part of the paper the connection of the normal inverse Gaussian distribution to the classes of generalized hyperbolic and inverse Gaussian distributions is briefly reviewed. Then a discussion is begun of the potential of the normal inverse Gaussian distribution and Levy process for modelling and analysing statistical data, with particular reference to extensive sets of observations from turbulence and from finance. These areas of application imply a need for extending the inverse Gaussian Levy process so as to accommodate certain, frequently observed, temporal dependence structures. Some extensions, of the stochastic volatility type, are constructed via an observation-driven approach to state space modelling. At the end of the paper generalizations to multivariate settings are indicated.
Automatic pulse-level calibration by tracking observables using iterative learning

Model-based quantum optimal control promises to solve a wide range of critical quantum technology problems within a single, flexible framework. The catch is that highly-accurate models are needed if the optimized controls are to meet the exacting demands set by quantum engineers. A practical alternative is to directly calibrate control parameters by taking device data and tuning until success is achieved. In quantum computing, gate errors due to inaccurate models can be efficiently polished if the control is limited to a few (usually hand-designed) parameters; however, an alternative tool set is required to enable efficient calibration of the complicated waveforms potentially returned by optimal control. We propose an automated model-based framework for calibrating quantum optimal controls called Learning Iteratively for Feasible Tracking (LIFT). LIFT achieves high-fidelity controls despite parasitic model discrepancies by precisely tracking feasible trajectories of quantum observables. Feasible trajectories are set by combining black-box optimal control and the bilinear dynamic mode decomposition, a physics-informed regression framework for discovering effective Hamiltonian models directly from rollout data. Any remaining tracking errors are eliminated in a non-causal way by applying model-based, norm-optimal iterative learning control to subsequent rollout data. We use numerical experiments of qubit gate synthesis to demonstrate how LIFT enables calibration of high-fidelity optimal control waveforms in spite of model discrepancies.
ACROCPoLis: A Descriptive Framework for Making Sense of Fairness

Fairness is central to the ethical and responsible development and use of AI systems, with a large number of frameworks and formal notions of algorithmic fairness being available. However, many of the fairness solutions proposed revolve around technical considerations and not the needs of and consequences for the most impacted communities. We therefore want to take the focus away from definitions and allow for the inclusion of societal and relational aspects to represent how the effects of AI systems impact and are experienced by individuals and social groups. In this paper, we do this by means of proposing the ACROCPoLis framework to represent allocation processes with a modeling emphasis on fairness aspects. The framework provides a shared vocabulary in which the factors relevant to fairness assessments for different situations and procedures are made explicit, as well as their interrelationships. This enables us to compare analogous situations, to highlight the differences in dissimilar situations, and to capture differing interpretations of the same situation by different stakeholders.
Conformally invariant metrics and lack of H\"older continuity

The modulus metric between two points in a subdomain of $\mathbb{R}^n, n\ge 2,$ is defined in terms of moduli of curve families joining the boundary of the domain with a continuum connecting the two points. This metric is one of the conformally invariant hyperbolic type metrics, which have become a standard tool in geometric function theory. We prove that the modulus metric is not H\"{o}lder continuous with respect to the hyperbolic metric.
CoReFace: Sample-Guided Contrastive Regularization for Deep Face Recognition

The discriminability of feature representation is the key to open-set face recognition. Previous methods rely on the learnable weights of the classification layer that represent the identities. However, the evaluation process learns no identity representation and drops the classifier from training. This inconsistency could confuse the feature encoder in understanding the evaluation goal and hinder the effect of identity-based methods. To alleviate the above problem, we propose a novel approach namely Contrastive Regularization for Face recognition (CoReFace) to apply image-level regularization in feature representation learning. Specifically, we employ sample-guided contrastive learning to regularize the training with the image-image relationship directly, which is consistent with the evaluation process. To integrate contrastive learning into face recognition, we augment embeddings instead of images to avoid the image quality degradation. Then, we propose a novel contrastive loss for the representation distribution by incorporating an adaptive margin and a supervised contrastive mask to generate steady loss values and avoid the collision with the classification supervision signal. Finally, we discover and solve the semantically repetitive signal problem in contrastive learning by exploring new pair coupling protocols. Extensive experiments demonstrate the efficacy and efficiency of our CoReFace which is highly competitive with the state-of-the-art approaches.
The Logic of Prefixes and Suffixes is Elementary under Homogeneity*

In this paper, we study the finite satisfiability problem for the logic BE under the homogeneity assumption. BE is the cornerstone of Halpern and Shoham’s interval temporal logic, and features modal operators corresponding to the prefix (a.k.a. "Begins") and suffix (a.k.a. "Ends") relations on intervals. In terms of complexity, BE lies in between the "Chop" logic C, whose satisfiability problem is known to be non-elementary, and the PSpace-complete interval logic D of the sub-interval (a.k.a. "During") relation. BE was shown to be ExpSpace-hard, and the only known satisfiability procedure is primitive recursive, but not elementary. Our contribution consists of tightening the complexity bounds of the satisfiability problem for BE, by proving it to be ExpSpace-complete. We do so by devising an equi-satisfiable normal form with boundedly many nested modalities. The normalization technique resembles Scott’s quantifier elimination, but it turns out to be much more involved due to the limitations enforced by the homogeneity assumption.
Sarah Frank-Wolfe: Methods for Constrained Optimization with Best Rates and Practical Features

The Frank-Wolfe (FW) method is a popular approach for solving optimization problems with structured constraints that arise in machine learning applications. In recent years, stochastic versions of FW have gained popularity, motivated by large datasets for which the computation of the full gradient is prohibitively expensive. In this paper, we present two new variants of the FW algorithms for stochastic finite-sum minimization. Our algorithms have the best convergence guarantees of existing stochastic FW approaches for both convex and non-convex objective functions. Our methods do not have the issue of permanently collecting large batches, which is common to many stochastic projection-free approaches. Moreover, our second approach does not require either large batches or full deterministic gradients, which is a typical weakness of many techniques for finite-sum problems. The faster theoretical rates of our approaches are confirmed experimentally.
Deconstructing Sentimental Stack Overflow Posts Through Interviews: Exploring the Case of Software Testing

The analysis of sentimental posts about software testing on Stack Overflow reveals that motivation and commitment of developers to use software testing methods is not only influenced by tools and technology. Rather, attitudes are also influenced by socio-technical factors. No prior studies have attempted to talk with Stack Overflow users about the sentimental posts that they write, yet, this is crucial to understand their experiences of which their post is only a fragment. As such, this study explores the precursors that make developers write sentimental posts about software testing on Stack Overflow. Through semi-structured interviews, we reconstruct the individual experiences of Stack Overflow users leading to sentimental posts about testing. We use the post as an anchor point to explore the events that lead to it and how users moved on in the meantime. Using strategies from socio-technical grounded theory (STGT), we derive hypotheses about the socio-technical factors that cause sentiment towards software testing.
A Deep Neural Network Deployment Based on Resistive Memory Accelerator Simulation

The objective of this study is to illustrate the process of training a Deep Neural Network (DNN) within a Resistive RAM (ReRAM) Crossbar-based simulation environment using CrossSim, an Application Programming Interface (API) developed for this purpose. The CrossSim API is designed to simulate neural networks while taking into account factors that may affect the accuracy of solutions during training on non-linear and noisy ReRAM devices. ReRAM-based neural cores that serve as memory accelerators for digital cores on a chip can significantly reduce energy consumption by minimizing data transfers between the processor and SRAM and DRAM. CrossSim employs lookup tables obtained from experimentally derived datasets of real fabricated ReRAM devices to digitally reproduce noisy weight updates to the neural network. The CrossSim directory comprises eight device configurations that operate at different temperatures and are made of various materials. This study aims to analyse the results of training a Neural Network on the Breast Cancer Wisconsin (Diagnostic) dataset using CrossSim, plotting the innercore weight updates and average training and validation loss to investigate the outcomes of all the devices.
Emergent Recurrent Extension Phase Transition in a Quasiperiodic Chain

We study $p$-wave superconducting quasiperiodic chains with staggered potential. The result shows a counter-intuitive phase transition phenomenon, i.e., recurrent extension phase transition (REPT). By analyzing the participation ration and scaling behavior, we prove the existence of REPT phenomenon, which, in concrete terms, means that the system will repeatedly return from the intermediate phase to the extended phase as the quasiperiodic or staggered strength grows. Furthermore, our finding is also quite different from the traditional understanding of intermediate phase (composed only of the pure extended phase and pure localized phase) in that, the new intermediate phase described here, stemming from the competition between staggered potential and $p$-wave pairing, actually falls into three types by bringing in the critical phase. To be specific, the new intermediate phases are composed of the critical + extended states, the critical + localized states, and the critical + extended + localized states, respectively.
Tutorial on Amortized Optimization

Optimization is a ubiquitous modeling tool and is often deployed in settings which repeatedly solve similar instances of the same problem. Amortized optimization methods use learning to predict the solutions to problems in these settings, exploiting the shared structure between similar problem instances. These methods have been crucial in variational inference and reinforcement learning and are capable of solving optimization problems many orders of magnitudes times faster than traditional optimization methods that do not use amortization. This tutorial presents an introduction to the amortized optimization foundations behind these advancements and overviews their applications in variational inference, sparse coding, gradient-based meta-learning, control, reinforcement learning, convex optimization, optimal transport, and deep equilibrium networks. The source code for this tutorial is available at https://github.com/facebookresearch/amortized-optimization-tutorial.
Energy-minimizing torus-valued maps with prescribed singularities, Plateau's problem, and BV-lifting

In this paper, we investigate the relation between energy-minimizing torus-valued maps with prescribed singularities, the lifting problem for torus-valued maps in the space BV, and Plateau's problem for vectorial currents, in codimension one. First, we show that the infimum of the $W^{1,1}$-seminorm among all maps with values in the $k$-dimensional flat torus and prescribed topological singularities $S$ is equal to the minimum of the mass among all $\textit{normal}$ $\mathbb{R}^k$-currents, of codimension one, bounded by $S$. Then, we show that the minimum of the $BV$-energy among all liftings of a given torus-valued $W^{1,1}$-map $\textbf{u}$ can be expressed in terms of the minimum mass among all $\textit{integral}$ $\mathbb{Z}^k$-currents, of codimension one, bounded by the singularities of $\textbf{u}$. As a byproduct of our analysis, we provide a bound for the solution of the integral Plateau problem, in codimension one, in terms of Plateau's problem for normal currents.
On the Identification of the Energy related Issues from the App Reviews

The energy inefficiency of the apps can be a major issue for the app users which is discussed on App Stores extensively. Previous research has shown the importance of investigating the energy related app reviews to identify the major causes or categories of energy related user feedback. However, there is no study that efficiently extracts the energy related app reviews automatically. In this paper, we empirically study different techniques for automatic extraction of the energy related user feedback. We compare the accuracy, F1-score and run time of numerous machine-learning models with relevant feature combinations and relatively modern Neural Network-based models. In total, 60 machine learning models are compared to 30 models that we build using six neural network architectures and three word embedding models. We develop a visualization tool for this study through which a developer can traverse through this large-scale result set. The results show that neural networks outperform the other machine learning techniques and can achieve the highest F1-score of 0.935. To replicate the research results, we have open sourced the interactive visualization tool. After identifying the best results and extracting the energy related reviews, we further compare various techniques to help the developers automatically investigate the emerging issues that might be responsible for energy inefficiency of the apps. We experiment the previously used string matching with results obtained from applying two of the state-of-the-art topic modeling algorithms, OBTM and AOLDA. Finally, we run a qualitative study performed in collaboration with developers and students from different institutions to determine their preferences for identifying necessary topics from previously categorized reviews, which shows OBTM produces the most helpful results.
Parameterized Learning and Distillation with Vortex-encoded Spectral Correlations

Spectral computational methods leverage modal or nonlocal representations of data, and a physically realized approach to spectral computation pertains to encoded diffraction. Encoded diffraction offers a hybrid approach that pairs analog wave propagation with digital back-end electronics, however the intermediate sensor patterns are correlations rather than linear signal weights, which limits the development of robust and efficient downstream analyses. Here, with vortex encoders, we show that the solution for the signal field from sensor intensity adopts the form of polynomial regression, which is subsequently solved with a learned, linear transformation. This result establishes an analytic rationale for a spectral-methods paradigm in physically realized machine learning systems. To demonstrate this paradigm, we quantify the learning that is transferred with an image basis using speckle parameters, Singular-Value Decomposition Entropy ($H_{SVD}$) and Speckle-Analogue Density (SAD). We show that $H_{SVD}$, a proxy for image complexity, indicates the rate at which a model converges. Similarly, SAD, an averaged spatial frequency, marks a threshold for structurally similar reconstruction. With a vortex encoder, this approach with parameterized training may be extended to distill features. In fact, with images reconstructed with our models, we achieve classification accuracies that rival decade-old, state-of-the-art computer algorithms. This means that the process of learning compressed spectral correlations distills features to aid image classification, even when the goal images are feature-agnostic speckles. Our work highlights opportunities for analytic and axiom-driven machine-learning designs appropriate for real-time applications.
Risk in Stochastic and Robust Model Predictive Path-Following Control for Vehicular Motion Planning

In automated driving, risk describes potential harm to passengers of an autonomous vehicle (AV) and other road users. Recent studies suggest that human-like driving behavior emerges from embedding risk in AV motion planning algorithms. Additionally, providing evidence that risk is minimized during the AV operation is essential to vehicle safety certification. However, there has yet to be a consensus on how to define and operationalize risk in motion planning or how to bound or minimize it during operation. In this paper, we define a stochastic risk measure and introduce it as a constraint into both robust and stochastic nonlinear model predictive path-following controllers (RMPC and SMPC respectively). We compare the vehicle’s behavior arising from employing SMPC and RMPC with respect to safety and path-following performance. Further, the implementation of an automated driving example is provided, showcasing the effects of different risk tolerances and uncertainty growths in predictions of other road users for both cases. We find that the RMPC is significantly more conservative than the SMPC, while also displaying greater following errors towards references. Further, the RMPCs behavior cannot be considered as human-like. Moreover, unlike SMPC, the RMPC cannot account for different risk tolerances. The RMPC generates undesired driving behavior for even moderate uncertainties, which are handled better by the SMPC.
Approximation of Optimal Control Surfaces for the Bass Model with Stochastic Dynamics

The Bass diffusion equation is a well-known and established modeling approach for describing new product adoption in a competitive market. This model also describes diffusion phenomena in various contexts: infectious disease spread modeling and estimation, rumor spread on social networks, prediction of renewable energy technology markets, among others. Most of these models, however, consider a deterministic trajectory of the associated state variable (e.g., market-share). In reality, the diffusion process is subject to noise, and a stochastic component must be added to the state dynamics. The stochastic Bass model has also been studied in many areas, such as energy markets and marketing. Exploring the stochastic version of the Bass diffusion model, we propose in this work an approximation of (stochastic) optimal control surfaces for a continuous-time problem arising from a $2\times2$ skew symmetric evolutionary game, providing the stochastic counter-part of the Fourier-based optimal control approximation already existent in the literature.
A bounded rationality account of dependency length minimization in Hindi

The principle of DEPENDENCY LENGTH MINIMIZATION, which seeks to keep syntactically related words close in a sentence, is thought to universally shape the structure of human languages for effective communication. However, the extent to which dependency length minimization is applied in human language systems is not yet fully understood. Preverbally, the placement of long-before-short constituents and postverbally, short-before-long constituents are known to minimize overall dependency length of a sentence. In this study, we test the hypothesis that placing only the shortest preverbal constituent next to the main-verb explains word order preferences in Hindi (a SOV language) as opposed to the global minimization of dependency length. We characterize this approach as a least-effort strategy because it is a cost-effective way to shorten all dependencies between the verb and its preverbal dependencies. As such, this approach is consistent with the bounded-rationality perspective according to which decision making is governed by"fast but frugal"heuristics rather than by a search for optimal solutions. Consistent with this idea, our results indicate that actual corpus sentences in the Hindi-Urdu Treebank corpus are better explained by the least effort strategy than by global minimization of dependency lengths. Additionally, for the task of distinguishing corpus sentences from counterfactual variants, we find that the dependency length and constituent length of the constituent closest to the main verb are much better predictors of whether a sentence appeared in the corpus than total dependency length. Overall, our findings suggest that cognitive resource constraints play a crucial role in shaping natural languages.
B2Opt: Learning to Optimize Black-box Optimization with Little Budget

The core challenge of high-dimensional and expensive black-box optimization (BBO) is how to obtain better performance faster with little function evaluation cost. The essence of the problem is how to design an efficient optimization strategy tailored to the target task. This paper designs a powerful optimization framework to automatically learn the optimization strategies from the target or cheap surrogate task without human intervention. However, current methods are weak for this due to poor representation of optimization strategy. To achieve this, 1) drawing on the mechanism of genetic algorithm, we propose a deep neural network framework called B2Opt, which has a stronger representation of optimization strategies based on survival of the fittest; 2) B2Opt can utilize the cheap surrogate functions of the target task to guide the design of the efficient optimization strategies. Compared to the state-of-the-art BBO baselines, B2Opt can achieve multiple orders of magnitude performance improvement with less function evaluation cost. We validate our proposal on high-dimensional synthetic functions and two real-world applications. We also find that deep B2Opt performs better than shallow ones.