Miracle-dz/UniFAR-FTUs huggingface dataset:
Learning Dynamic Attribute-factored World Models for Efficient Multi-object Reinforcement Learning

In many reinforcement learning tasks, the agent has to learn to interact with many objects of different types and generalize to unseen combinations and numbers of objects. Often a task is a composition of previously learned tasks (e.g. block stacking). These are examples of compositional generalization, in which we compose object-centric representations to solve complex tasks. Recent works have shown the benefits of object-factored representations and hierarchical abstractions for improving sample efficiency in these settings. On the other hand, these methods do not fully exploit the benefits of factorization in terms of object attributes. In this paper, we address this opportunity and introduce the Dynamic Attribute FacTored RL (DAFT-RL) framework. In DAFT-RL, we leverage object-centric representation learning to extract objects from visual inputs. We learn to classify them in classes and infer their latent parameters. For each class of object, we learn a class template graph that describes how the dynamics and reward of an object of this class factorize according to its attributes. We also learn an interaction pattern graph that describes how objects of different classes interact with each other at the attribute level. Through these graphs and a dynamic interaction graph that models the interactions between objects, we can learn a policy that can then be directly applied in a new environment by just estimating the interactions and latent parameters. We evaluate DAFT-RL in three benchmark datasets and show our framework outperforms the state-of-the-art in generalizing across unseen objects with varying attributes and latent parameters, as well as in the composition of previously learned tasks.
Noise Reduction in a Reputation Index

Assuming that a time series incorporates “signal” and “noise” components, we propose a method to estimate the extent of the “noise” component by considering the smoothing properties of the state-space of the time series. A mild degree of smoothing in the state-space, applied using a Kalman filter, allows for noise estimation arising from the measurement process. It is particularly suited in the context of a reputation index, because small amounts of noise can easily mask more significant effects. Adjusting the state-space noise measurement parameter leads to a limiting smoothing situation, from which the extent of noise can be estimated. The results indicate that noise constitutes approximately 10% of the raw signal: approximately 40 decibels. A comparison with low pass filter methods (Butterworth in particular) is made, although low pass filters are more suitable for assessing total signal noise.
Unsupervised Deep Graph Matching Based on Cycle Consistency

We contribute to the sparsely populated area of unsupervised deep graph matching with application to keypoint matching in images. Contrary to the standard \emph{supervised} approach, our method does not require ground truth correspondences between keypoint pairs. Instead, it is self-supervised by enforcing consistency of matchings between images of the same object category. As the matching and the consistency loss are discrete, their derivatives cannot be straightforwardly used for learning. We address this issue in a principled way by building our method upon the recent results on black-box differentiation of combinatorial solvers. This makes our method exceptionally flexible, as it is compatible with arbitrary network architectures and combinatorial solvers. Our experimental evaluation suggests that our technique sets a new state-of-the-art for unsupervised graph matching.
Fully Dynamic Matching: (2-√2)-Approximation in Polylog Update Time

We study maximum matchings in fully dynamic graphs, which are graphs that undergo both edge insertions and deletions. Our focus is on algorithms that estimate the size of maximum matching after each update while spending a small time. An important question studied extensively is the best approximation achievable via algorithms that only spend $\text{poly}(\log n)$ time per update, where $n$ is the number of vertices. The current best bound is a $(1/2+\varepsilon_0)$-approximation for a small constant $\varepsilon_0>0$, due to recent works of Behnezhad [SODA'23] ($\varepsilon_0 \sim 0.001$) and Bhattacharya, Kiss, Saranurak, Wajc [SODA'23] ($\varepsilon_0 \sim 0.006$) who broke the long-standing 1/2-approximation barrier. These works also showed that for any fixed $\varepsilon>0$, the approximation can be further improved to $(2-\sqrt{2}-\varepsilon) \sim . 585$ for bipartite graphs, leaving a huge gap between general and bipartite graphs. In this work, we close this gap. We show that for any fixed $\varepsilon>0$, a $(2-\sqrt{2}-\varepsilon)$ approximation can be maintained in $\text{poly}(\log n)$ time per update even in general graphs. Our techniques also lead to the same approximation for general graphs in two passes of the semi-streaming setting, removing a similar gap in that setting.
Multistage Cable Routing Through Hierarchical Imitation Learning

We study the problem of learning to perform multistage robotic manipulation tasks, with applications to cable routing, where the robot must route a cable through a series of clips. This setting presents challenges representative of complex multistage robotic manipulation scenarios: handling deformable objects, closing the loop on visual perception, and handling extended behaviors consisting of multiple steps that must be executed successfully to complete the entire task. In such settings, learning individual primitives for each stage that succeed with a high enough rate to perform a complete temporally extended task is impractical: if each stage must be completed successfully and has a nonnegligible probability of failure, the likelihood of successful completion of the entire task becomes negligible. Therefore, successful controllers for such multistage tasks must be able to recover from failure and compensate for imperfections in low-level controllers by smartly choosing which controllers to trigger at any given time, retrying, or taking corrective action as needed. To this end, we describe an imitation learning system that uses vision-based policies trained from demonstrations at both the lower (motor control) and the upper (sequencing) level, present a system for instantiating this method to learn the cable routing task, and perform evaluations showing great performance in generalizing to very challenging clip placement variations.
Novel Nanostructures and Materials for Strong Light–Matter Interactions

Quantum mechanical interactions between electromagnetic radiation and matter underlie a broad spectrum of optical phenomena. Strong light-matter interactions result in the well-known vacuum Rabi splitting and emergence of new polaritonic eigenmodes of the coupled system. Thanks to recent progress in nanofabrication, observation of strong coupling has become possible in a great variety of optical nanostructures. Here, we review recently studied and emerging materials for realization of strong light–matter interactions. We present general theoretical formalism describing strong coupling and give an overview of various photonic structures and materials allowing for realization of this regime, including plasmonic and dielectric nanoantennas, novel two-dimensional materials, carbon nanotubes, and molecular vibrational transitions. In addition, we discuss practical applications that can benefit from these effects and give an outlook on unsettled questions that remain open for future research.
Implementation of Single-Qutrit Quantum Gates via Tripod Adiabatic Passage

We proposed and analyzed implementation of the single-qutrit quantum gates based on stimulated Raman adiabatic passage (STIRAP) between magnetic sublevels in atoms coupled by pulsed laser fields. This technique requires only the control of the relative phase of the driving fields but do not involve any dynamical or geometrical phases, which make it independent of the other interaction details: detuning and pulse shapes, areas and durations. The suggested techniques are immune to spontaneous emission since the qubit and qutrit manipulation proceeds through non-absorbing dark states. In this paper, taking proper timing of the Rabi frequencies allows us to transfer the population of the system to a desired superposition of the ground states with the highest fidelity. We also obtained and implemented single-qutrit unitary gates, for transferring of the population of the system with different initial and final states.
Cloud-native RStudio on Kubernetes for Hopsworks

In order to fully benefit from cloud computing, services are designed following the"multi-tenant"architectural model, which is aimed at maximizing resource sharing among users. However, multi-tenancy introduces challenges of security, performance isolation, scaling, and customization. RStudio server is an open-source Integrated Development Environment (IDE) accessible over a web browser for the R programming language. We present the design and implementation of a multi-user distributed system on Hopsworks, a data-intensive AI platform, following the multi-tenant model that provides RStudio as Software as a Service (SaaS). We use the most popular cloud-native technologies: Docker and Kubernetes, to solve the problems of performance isolation, security, and scaling that are present in a multi-tenant environment. We further enable secure data sharing in RStudio server instances to provide data privacy and allow collaboration among RStudio users. We integrate our system with Apache Spark, which can scale and handle Big Data processing workloads. Also, we provide a UI where users can provide custom configurations and have full control of their own RStudio server instances. Our system was tested on a Google Cloud Platform cluster with four worker nodes, each with 30GB of RAM allocated to them. The tests on this cluster showed that 44 RStudio servers, each with 2GB of RAM, can be run concurrently. Our system can scale out to potentially support hundreds of concurrently running RStudio servers by adding more resources (CPUs and RAM) to the cluster or system.
Biomaker CA: a Biome Maker project using Cellular Automata

We introduce Biomaker CA: a Biome Maker project using Cellular Automata (CA). In Biomaker CA, morphogenesis is a first class citizen and small seeds need to grow into plant-like organisms to survive in a nutrient starved environment and eventually reproduce with variation so that a biome survives for long timelines. We simulate complex biomes by means of CA rules in 2D grids and parallelize all of its computation on GPUs through the Python JAX framework. We show how this project allows for several different kinds of environments and laws of 'physics', alongside different model architectures and mutation strategies. We further analyze some configurations to show how plant agents can grow, survive, reproduce, and evolve, forming stable and unstable biomes. We then demonstrate how one can meta-evolve models to survive in a harsh environment either through end-to-end meta-evolution or by a more surgical and efficient approach, called Petri dish meta-evolution. Finally, we show how to perform interactive evolution, where the user decides how to evolve a plant model interactively and then deploys it in a larger environment. We open source Biomaker CA at: https://tinyurl.com/2x8yu34s .
Active learning for effective Hamiltonian of super-large-scale atomic structures

The first-principles-based effective Hamiltonian is widely used to predict and simulate the properties of ferroelectrics and relaxor ferroelectrics. However, the parametrization method of the effective Hamiltonian is complicated and hardly can resolve the systems with complex interactions and/or complex components. Here, we developed an on-the-fly active machine learning approach to parametrize the effective Hamiltonian based on Bayesian linear regression. The parametrization is completed in molecular dynamics simulations, with the energy, forces and stress predicted at each step along with their uncertainties. First-principles calculations are executed when the uncertainties are large to retrain the parameters. This approach provides a universal and automatic way to compute the effective Hamiltonian parameters for any considered systems including complex systems which previous methods can not handle. The form of the effective Hamiltonian is also revised to include some complex terms. BaTiO3, CsPbI3 and SrTiO3/PbTiO3 surface are taken as examples to show the accurateness of this approach comparing with conventional first-principles parametrization method.
Is Kyle’s Equilibrium Model Stable?

In the dynamic discrete-time trading setting of Kyle (1985), we prove that Kyle's equilibrium model is stable when there are one or two trading times. For three or more trading times, we prove that Kyle's equilibrium is not stable. These theoretical results are proven to hold irrespectively of all Kyle's input parameters.
Spectral and polarization properties of reflected X-ray emission from black-hole accretion discs for a distant observer: the lamp-post model

Rebirth of X-ray polarimetric instruments will have a significant impact on our knowledge of compact accreting sources. The properties of inner-accreting regions of active galactic nuclei (AGNs) or X-ray binary systems (XRBs), such as black-hole spin, their disc inclination and orientation, shape and size of their corona, can be polarimetrically studied, parallelly to the well-known X-ray spectroscopic and timing techniques. In this work, we provide a new spectropolarimetric numerical estimate of X-rays in the lamp-post coronal model for a distant observer, including a polarized reflected radiation from the accretion disc. The local disc reflection was simulated using the codes TITAN and STOKES and includes variable disc ionization as well as Monte Carlo treatment of Compton multiple scatterings. We introduce a relativistic code KYNSTOKES based on our well-tested KY package that accounts for all relativistic effects on radiation near a black hole, apart from the returning radiation, and adds a possibility of polarized coronal emission. We study the spectrum, polarization degree and polarization angle at spatial infinity for various global system parameters and we demonstrate the difference at infinity, if analytical local reflection computations are used. We newly predict that in the hard X-rays the reflected component can be 25% polarized and the total emission can be 9% polarized in the most favourable, yet realistic configurations of radio-quiet AGNs. Thus, the relativistic disc reflection remains important for the interpretation of X-ray polarimetric observations.
Systematic comparison of semi-supervised and self-supervised learning for medical image classification

In many medical image classification problems, labeled data is scarce while unlabeled data is more available. Semi-supervised learning and self-supervised learning are two different research directions that can improve accuracy by learning from extra unlabeled data. Recent methods from both directions have reported significant gains on traditional benchmarks. Yet past benchmarks do not focus on medical tasks and rarely compare self- and semi- methods together on equal footing. Furthermore, past benchmarks often handle hyperparameter tuning suboptimally. First, they may not tune hyperparameters at all, leading to underfitting. Second, when tuning does occur, it often unrealistically uses a labeled validation set much larger than the train set. Both cases make previously published rankings of methods difficult to translate to practical settings. This study contributes a systematic evaluation of self- and semi- methods with a unified experimental protocol intended to guide a practitioner with scarce overall labeled data and a limited compute budget. We answer two key questions: Can hyperparameter tuning be effective with realistic-sized validation sets? If so, when all methods are tuned well, which self- or semi-supervised methods reach the best accuracy? Our study compares 13 representative semi- and self-supervised methods to strong labeled-set-only baselines on 4 medical datasets. From 20000+ total GPU hours of computation, we provide valuable best practices to resource-constrained, results-focused practitioners.
Flow Graph Network Based Non-redundant Correlative Educational Rules Discovered

A correlative rule expresses a relationship between two correlative events happening one after another. These rules are potentially useful for analyzing correlative data, ranging from purchase histories, web logs and program execution traces. In this work, we investigate and propose a syntactic characterization of a non-redundant set of correlative rules built upon past work on compact set of representative patterns. When using the set of mined rules as a composite filter, replacing a full set of rules with a non-redundant subset of the rules does not impact the accuracy of the filter. Lastly, we propose an algorithm to mine this compressed set of non-redundant rules. A performance study shows that the proposed algorithm significantly improves both the run-time and compactness of mined rules over mining a full set of sequential rules.
Artificial Intelligence for Real Sustainability? -- What is Artificial Intelligence and Can it Help with the Sustainability Transformation?

The discussion about the disruptive possibilities of a technology called artificial intelligence (AI) is on everyone's lips. Companies and countries alike are running multi-billion-dollar research programmes to ensure they do not miss out on the global innovation hunt. Among many other applications, AI is also supposed to aid the large-scale changes needed to achieve sustainable societies. To assess those claims and possibilities, this article briefly explains, classifies, and theorises AI technology and then politically contextualises that analysis in light of the sustainability discourse. Based on those insights it finally argues, that AI can play a small role in moving towards sustainable societies, however the fixation on technological innovation, especially AI, obscures and depoliticises the necessary societal decisions regarding sustainability goals and means as mere technicalities and therefore rather obstructs real and effective societal transformation efforts.
Cross-points in the Dirichlet-Neumann method II: a geometrically convergent variant

When considered as a standalone iterative solver for elliptic boundary value problems, the Dirichlet-Neumann (DN) method is known to converge geometrically for domain decompositions into strips, even for a large number of subdomains. However, whenever the domain decomposition includes cross-points, i.e.$\! $ points where more than two subdomains meet, the convergence proof does not hold anymore as the method generates subproblems that might not be well-posed. Focusing on a simple two-dimensional example involving one cross-point, we proposed in a previous work a decomposition of the solution into two parts: an even symmetric part and an odd symmetric part. Based on this decomposition, we proved that the DN method was geometrically convergent for the even symmetric part and that it was not well-posed for the odd symmetric part. Here, we introduce a new variant of the DN method which generates subproblems that remain well-posed for the odd symmetric part as well. Taking advantage of the symmetry properties of the domain decomposition considered, we manage to prove that our new method converges geometrically in the presence of cross-points. We also extend our results to the three-dimensional case, and present numerical experiments that illustrate our theoretical findings.
Enhancing Pattern Classification in Support Vector Machines through Matrix Formulation

Support Vector Machines (SVM) have gathered significant acclaim as classifiers due to their successful implementation of Statistical Learning Theory. However, in the context of multiclass and multilabel settings, the reliance on vector-based formulations in existing SVM-based models poses limitations regarding flexibility and ease of incorporating additional terms to handle specific challenges. To overcome these limitations, our research paper focuses on introducing a matrix formulation for SVM that effectively addresses these constraints. By employing the Accelerated Gradient Descent method in the dual, we notably enhance the efficiency of solving the Matrix-SVM problem. Experimental evaluations on multilabel and multiclass datasets demonstrate that Matrix SVM achieves superior time efficacy while delivering similar results to Binary Relevance SVM. Moreover, our matrix formulation unveils crucial insights and advantages that may not be readily apparent in traditional vector-based notations. We emphasize that numerous multilabel models can be viewed as extensions of SVM, with customised modifications to meet specific requirements. The matrix formulation presented in this paper establishes a solid foundation for developing more sophisticated models capable of effectively addressing the distinctive challenges encountered in multilabel learning.
A Novel Application of Conditional Normalizing Flows: Stellar Age Inference with Gyrochronology

Stellar ages are critical building blocks of evolutionary models, but challenging to measure for low mass main sequence stars. An unexplored solution in this regime is the application of probabilistic machine learning methods to gyrochronology, a stellar dating technique that is uniquely well suited for these stars. While accurate analytical gyrochronological models have proven challenging to develop, here we apply conditional normalizing flows to photometric data from open star clusters, and demonstrate that a data-driven approach can constrain gyrochronological ages with a precision comparable to other standard techniques. We evaluate the flow results in the context of a Bayesian framework, and show that our inferred ages recover literature values well. This work demonstrates the potential of a probabilistic data-driven solution to widen the applicability of gyrochronological stellar dating.
Reflections from the Workshop on AI-Assisted Decision Making for Conservation

In this white paper, we synthesize key points made during presentations and discussions from the AI-Assisted Decision Making for Conservation workshop, hosted by the Center for Research on Computation and Society at Harvard University on October 20-21, 2022. We identify key open research questions in resource allocation, planning, and interventions for biodiversity conservation, highlighting conservation challenges that not only require AI solutions, but also require novel methodological advances. In addition to providing a summary of the workshop talks and discussions, we hope this document serves as a call-to-action to orient the expansion of algorithmic decision-making approaches to prioritize real-world conservation challenges, through collaborative efforts of ecologists, conservation decision-makers, and AI researchers.
Batched Predictors Generalize within Distribution

We study the generalization properties of batched predictors, i.e., models tasked with predicting the mean label of a small set (or batch) of examples. The batched prediction paradigm is particularly relevant for models deployed to determine the quality of a group of compounds in preparation for offline testing. By utilizing a suitable generalization of the Rademacher complexity, we prove that batched predictors come with exponentially stronger generalization guarantees as compared to the standard per-sample approach. Surprisingly, the proposed bound holds independently of overparametrization. Our theoretical insights are validated experimentally for various tasks, architectures, and applications.