Miracle-dz/UniFAR-FTUs huggingface dataset:
Dual gradient method for ill-posed problems using multiple repeated measurement data

We consider determining -minimizing solutions of linear ill-posed problems Ax=y , where A:X→Y is a bounded linear operator from a Banach space X to a Hilbert space Y and is a proper strongly convex penalty function. Assuming that multiple repeated independent identically distributed unbiased data of y are available, we consider a dual gradient method to reconstruct the -minimizing solution using the average of these data. By terminating the method by either an a priori stopping rule or a statistical variant of the discrepancy principle, we provide the convergence analysis and derive convergence rates when the sought solution satisfies certain variational source conditions. Various numerical results are reported to test the performance of the method.
Continuous Episodic Control

Non-parametric episodic memory can be used to quickly latch onto high-rewarded experience in reinforcement learning tasks. In contrast to parametric deep reinforcement learning approaches in which reward signals need to be back-propagated slowly, these methods only need to discover the solution once, and may then repeatedly solve the task. However, episodic control solutions are stored in discrete tables, and this approach has so far only been applied to discrete action space problems. Therefore, this paper introduces Continuous Episodic Control (CEC), a novel non-parametric episodic memory algorithm for sequential decision making in problems with a continuous action space. Results on several sparse-reward continuous control environments show that our proposed method learns faster than state-of-the-art model-free RL and memory-augmented RL algorithms, while maintaining good long-run performance as well. In short, CEC can be a fast approach for learning in continuous control tasks. 1
Helicity amplitudes in light-cone and Feynman-diagram gauges

Recently proposed Feynman-diagram (FD) gauge propagator for massless and massive gauge bosons is obtained from a light-cone (LC) gauge propagator, by choosing the gauge vector along the opposite direction of the gauge boson three-momentum. We implement a general LC gauge propagator for all the gauge bosons of the Standard Model (SM) in the HELicity Amplitude Subroutines (HELAS) codes, such that all the SM helicity amplitudes can be evaluated at the tree level in the LC gauge by using MadGraph. We confirm that our numerical codes produce physical helicity amplitudes which are consistent among all gauge choices. We then study interference patterns among Feynman amplitudes, for a few $2\to3$ scattering processes in QED and QCD, and the process $\gamma\gamma\to W^+W^-$ followed by the $W^\pm$ decays. We find that in a generic LC gauge, where all the gauge boson propagators share a common gauge vector, we cannot remove the off-shell current components which grow with their energy systematically from all the Feynman amplitudes in $2\to3$ processes. On the other hand, the $5\times5$ LC gauge propagator for the weak bosons removes components which grow with energy due to the longitudinal polarization mode of the external bi-fermion currents, and hence can give $2\to2$ weak boson scattering amplitudes which are free from subtle cancellation at high energies. The particular choice of the FD gauge vector has advantages over generic LC gauge, not only because all the terms which grow with energy of off-shell and on-shell currents are removed systematically from all the diagrams, but also because no artificial gauge vector direction dependence of individual amplitudes appears.
GLAMI-1M: A Multilingual Image-Text Fashion Dataset

We introduce GLAMI-1M: the largest multilingual image-text classification dataset and benchmark. The dataset contains images of fashion products with item descriptions, each in 1 of 13 languages. Categorization into 191 classes has high-quality annotations: all 100k images in the test set and 75% of the 1M training set were human-labeled. The paper presents baselines for image-text classification showing that the dataset presents a challenging fine-grained classification problem: The best scoring EmbraceNet model using both visual and textual features achieves 69.7% accuracy. Experiments with a modified Imagen model show the dataset is also suitable for image generation conditioned on text. The dataset, source code and model checkpoints are published at https://github.com/glami/glami-1m
EPIK: Eliminating multi-model Pipelines with Knowledge-distillation

—Real-world tasks are largely composed of multiple models, each performing a sub-task in a larger chain of tasks, i.e., using the output from a model as input for another model in a multi-model pipeline. A model like MATRa performs the task of Crosslingual Transliteration in two stages, using English as an intermediate transliteration target when transliterating between two indic languages. We propose a novel distillation technique, EPIK, that condenses two-stage pipelines for hierarchical tasks into a single end-to-end model without compromising performance. This method can create end-to-end models for tasks without needing a dedicated end-to-end dataset, solving the data scarcity problem. The EPIK model has been distilled from the MATra model using this technique of knowledge distillation. The MATra model can perform crosslingual transliteration between 5 languages - English, Hindi, Tamil, Kannada and Bengali. The EPIK model executes the task of transliteration without any intermediate English output while retaining the performance and accuracy of the MATra model. The EPIK model can perform transliteration with an average CER score of 0.015 and average phonetic accuracy of 92.1%. In addition, the average time for execution has reduced by 54.3% as compared to the teacher model and has a similarity score of 97.5% with the teacher encoder. In a few cases, the EPIK model (student model) can outperform the MATra model (teacher model) even though it has been distilled from the MATra model.
Noncoding RNAs improve the predictive power of network medicine

Significance Network medicine has been used to quantify disease mechanisms, comorbidities, and treatments, but most approaches have ignored interactions mediated by noncoding RNAs (ncRNAs). This study systematically combines experimentally confirmed ncRNA and protein–protein interactions to construct a comprehensive network of all physical interactions in the human cell. The inclusion of ncRNA increases the number of genes and interactions in the interactome and enhances the ability to identify disease modules and predict comorbidity patterns between diseases. Ultimately, this study shows that including noncoding interactions improves the breadth and accuracy of network medicine.
Machine-learning-assisted construction of appropriate rotating frame

Machine learning with neural networks is now becoming a more and more powerful tool for various tasks, such as natural language processing, image recognition, winning the game, and even for the issues of physics. Although there are many studies on the application of machine learning to numerical calculation and the assistance of experimental detection, the methods of applying machine learning to find the analytical method are poorly studied. In this letter, we propose methods to use machine learning to find the analytical methods. We demonstrate that the recurrent neural networks can ``derive'' the Floquet-Magnus expansion just by inputting the time-periodic Hamiltonian to the neural networks, and derive the appropriate rotating frame in the periodically-driven system. We also argue that this method is also applicable to finding other theoretical frameworks in other systems.
Incentive-Aware Recommender Systems in Two-Sided Markets

Online platforms in the Internet Economy commonly incorporate recommender systems that recommend arms (e.g., products) to agents (e.g., users). In such platforms, a myopic agent has a natural incentive to exploit, by choosing the best product given the current information rather than to explore various alternatives to collect information that will be used for other agents. We propose a novel recommender system that respects agents' incentives and enjoys asymptotically optimal performances expressed by the regret in repeated games. We model such an incentive-aware recommender system as a multi-agent bandit problem in a two-sided market which is equipped with an incentive constraint induced by agents' opportunity costs. If the opportunity costs are known to the principal, we show that there exists an incentive-compatible recommendation policy, which pools recommendations across a genuinely good arm and an unknown arm via a randomized and adaptive approach. On the other hand, if the opportunity costs are unknown to the principal, we propose a policy that randomly pools recommendations across all arms and uses each arm's cumulative loss as feedback for exploration. We show that both policies also satisfy an ex-post fairness criterion, which protects agents from over-exploitation.
The 15-Minute City Quantified Using Mobility Data

Americans travel 7 to 9 miles on average for shopping and recreational activities, which is far longer than the 15-minute (walking) city advocated by ecologically-oriented urban planners. This paper provides a comprehensive analysis of local trip behavior in US cities using GPS data on individual trips from 40 million mobile devices. We define local usage as the share of trips made within 15-minutes walking distance from home, and find that the median US city resident makes only 12% of their daily trips within such a short distance. We find that differences in access to local services can explain eighty percent of the variation in 15-minute usage across metropolitan areas and 74 percent of the variation in usage within metropolitan areas. Differences in historic zoning permissiveness within New York suggest a causal link between access and usage, and that less restrictive zoning rules, such as permitting more mixed-use development, would lead to shorter travel times. Finally, we document a strong correlation between local usage and experienced segregation for poorer, but not richer, urbanites, which suggests that 15-minute cities may also exacerbate the social isolation of marginalized communities.
Quincunx filter lifting scheme for image coding

This paper introduces a new construction of quincunx wavelet transform. This new transform is a bidimensional extension of the factorization of wavelet transform into lifting scheme for finite and symmetrical low pass filters. The aim of this method is to deal with quincunx images by appropriate transforms while using advantages offered by the lifting scheme. Indeed, quincunx sampling is of big interest for image coding applications. For example recent remote sensors of satellites return quincunx sampled images. Moreover, a quincunx sampling allows the decomposition of the image into two channels and to have a twice as accurate multiresolution analysis as the dyadic one.
Deep learning optimal quantum annealing schedules for random Ising models

A crucial step in the race towards quantum advantage is optimizing quantum annealing using ad-hoc annealing schedules. Motivated by recent progress in the field, we propose to employ long-short term memory neural networks to automate the search for optimal annealing schedules for random Ising models on regular graphs. By training our network using locally-adiabatic annealing paths, we are able to predict optimal annealing schedules for unseen instances and even larger graphs than those used for training.
3D Reconstruction of Protein Complex Structures Using Synthesized Multi-View AFM Images

Recent developments in deep learning-based methods demonstrated its potential to predict the 3D protein structures using inputs such as protein sequences, Cryo-Electron microscopy (Cryo-EM) images of proteins, etc. However, these methods struggle to predict the protein complexes (PC), structures with more than one protein. In this work, we explore the atomic force microscope (AFM) assisted deep learning-based methods to predict the 3D structure of PCs. The images produced by AFM capture the protein structure in different and random orientations. These multi-view images can help train the neural network to predict the 3D structure of protein complexes. However, obtaining the dataset of actual AFM images is time-consuming and not a pragmatic task. We propose a virtual AFM imaging pipeline that takes a 'PDB' protein file and generates multi-view 2D virtual AFM images using volume rendering techniques. With this, we created a dataset of around 8K proteins. We train a neural network for 3D reconstruction called Pix2Vox++ using the synthesized multi-view 2D AFM images dataset. We compare the predicted structure obtained using a different number of views and get the intersection over union (IoU) value of 0.92 on the training dataset and 0.52 on the validation dataset. We believe this approach will lead to better prediction of the structure of protein complexes.
Efficient Video Prediction via Sparsely Conditioned Flow Matching

We introduce a novel generative model for video prediction based on latent flow matching, an efficient alternative to diffusion-based models. In contrast to prior work, we keep the high costs of modeling the past during training and inference at bay by conditioning only on a small random set of past frames at each integration step of the image generation process. Moreover, to enable the generation of high-resolution videos and to speed up the training, we work in the latent space of a pretrained VQGAN. Finally, we propose to approximate the initial condition of the flow ODE with the previous noisy frame. This allows to reduce the number of integration steps and hence, speed up the sampling at inference time. We call our model Random frame conditioned flow Integration for VidEo pRediction, or, in short, RIVER. We show that RIVER achieves superior or on par performance compared to prior work on common video prediction benchmarks, while requiring an order of magnitude fewer computational resources. Project website: https://araachie.github. io/river.
Self-supervised surgical instrument 3D reconstruction from a single camera image

Surgical instrument tracking is an active research area that can provide surgeons feedback about the location of their tools relative to anatomy. Recent tracking methods are mainly divided into two parts: segmentation and object detection. However, both can only predict 2D information, which is limiting for application to real-world surgery. An accurate 3D surgical instrument model is a prerequisite for precise predictions of the pose and depth of the instrument. Recent singleview 3D reconstruction methods are only used in natural object reconstruction and do not achieve satisfying reconstruction accuracy without 3D attribute-level supervision. Further, those methods are not suitable for the surgical instruments because of their elongated shapes. In this paper, we firstly propose an end-to-end surgical instrument reconstruction system — Self-supervised Surgical Instrument Reconstruction (SSIR). With SSIR, we propose a multi-cycle-consistency strategy to help capture the texture information from a slim instrument while only requiring a binary instrument label map. Experiments demonstrate that our approach improves the reconstruction quality of surgical instruments compared to other self-supervised methods and achieves promising results.
FAST MULTISCALE FUNCTIONAL ESTIMATION IN OPTIMAL EMG PLACEMENT FOR ROBOTIC PROSTHESIS CONTROLLERS

Electrocardiogram (EMG) signals play a significant role in decoding muscle contraction information for robotic hand prosthesis controllers. Widely applied decoders require large amount of EMG signals sensors, resulting in complicated calculations and unsatisfactory predictions. By the biomechanical process of single degree-of-freedom human hand movements, only several EMG signals are essential for accurate predictions. Recently, a novel predictor of hand movements adopts a multistage Sequential, Adaptive Functional Estimation (SAFE) method based on historical Functional Linear Model (FLM) to select important EMG signals and provide precise projections. However, SAFE repeatedly performs matrix-vector multiplications with a dense representation matrix of the integral operator for the FLM, which is computational expansive. Noting that with a properly chosen basis, the representation of the integral operator concentrates on a few bands of the basis, the goal of this study is to develop a fast Multiscale SAFE (MSAFE) method aiming at reducing computational costs while preserving (or even improving) the accuracy of the original SAFE method. Specifically, a multiscale piecewise polynomial basis is adopted to discretize the integral operator for the FLM, resulting in an approximately sparse representation matrix, and then the matrix is truncated to a sparse one. This approach not only accelerates computations but also improves robustness against noises. When applied to real hand movement data, MSAFE saves 85%$\sim$90% computing time compared with SAFE, while producing better sensor selection and comparable accuracy. In a simulation study, MSAFE shows stronger stability in sensor selection and prediction accuracy against correlated noise than SAFE.
c-TPE: Generalizing Tree-structured Parzen Estimator with Inequality Constraints for Continuous and Categorical Hyperparameter Optimization

Hyperparameter optimization (HPO) is crucial for strong performance of deep learning algorithms. A widely-used versatile HPO method is a variant of Bayesian optimization called tree-structured Parzen estimator (TPE), which splits data into good and bad groups and uses the density ratio of those groups as an acquisition function (AF). However, real-world applications often have some constraints, such as memory requirements, or latency. In this paper, we present an extension of TPE to constrained optimization (c-TPE) via simple factorization of AFs. The experiments demonstrate c-TPE is robust to various constraint levels and exhibits the best average rank performance among existing methods with statistical signiﬁcance on search spaces with categorical parameters on 81 settings.
Node and Edge Differential Privacy for Graph Laplacian Spectra: Mechanisms and Scaling Laws

This paper develops a framework for privatizing the spectrum of the Laplacian of an undirected graph using differential privacy. We consider two privacy formulations. The first obfuscates the presence of edges in the graph and the second obfuscates the presence of nodes. We compare these two privacy formulations and show that the privacy formulation that considers edges is better suited to most engineering applications. We use the bounded Laplace mechanism to provide $(\epsilon,\delta)$-differential privacy to the eigenvalues of a graph Laplacian, and we pay special attention to the algebraic connectivity, which is the Laplacian's the second smallest eigenvalue. Analytical bounds are presented on the accuracy of the mechanisms and on certain graph properties computed with private spectra. A suite of numerical examples confirms the accuracy of private spectra in practice.
Masked Autoencoders for Egocentric Video Understanding @ Ego4D Challenge 2022

In this report, we present our approach and empirical results of applying masked autoencoders in two egocentric video understanding tasks, namely, Object State Change Classification and PNR Temporal Localization, of Ego4D Challenge 2022. As team TheSSVL, we ranked 2nd place in both tasks. Our code will be made available.
Interactive Visual Feature Search

Many visualization techniques have been created to explain the behavior of computer vision models, but they largely consist of static diagrams that convey limited information. Interactive visualizations allow users to more easily interpret a model's behavior, but most are not easily reusable for new models. We introduce Visual Feature Search, a novel interactive visualization that is adaptable to any CNN and can easily be incorporated into a researcher's workflow. Our tool allows a user to highlight an image region and search for images from a given dataset with the most similar model features. We demonstrate how our tool elucidates different aspects of model behavior by performing experiments on a range of applications, such as in medical imaging and wildlife classification.
Toward Universal Text-To-Music Retrieval

This paper introduces effective design choices for text-to-music retrieval systems. An ideal text-based retrieval system would support various input queries such as pre-defined tags, unseen tags, and sentence-level descriptions. In reality, most previous works mainly focused on a single query type (tag or sentence) which may not generalize to another input type. Hence, we review recent text-based music retrieval systems using our proposed benchmark in two main aspects: input text representation and training objectives. Our findings enable a universal text-to-music retrieval system that achieves comparable retrieval performances in both tag- and sentence-level inputs. Furthermore, the proposed multimodal representation generalizes to 9 different downstream music classification tasks. We present the code and demo online.1
SuNeRF: Validation of a 3D Global Reconstruction of the Solar Corona Using Simulated EUV Images

Extreme Ultraviolet (EUV) light emitted by the Sun impacts satellite operations and communications and affects the habitability of planets. Currently, EUV-observing instruments are constrained to viewing the Sun from its equator (i.e., ecliptic), limiting our ability to forecast EUV emission for other viewpoints (e.g. solar poles), and to generalize our knowledge of the Sun-Earth system to other host stars. In this work, we adapt Neural Radiance Fields (NeRFs) to the physical properties of the Sun and demonstrate that non-ecliptic viewpoints could be reconstructed from observations limited to the solar ecliptic. To validate our approach, we train on simulations of solar EUV emission that provide a ground truth for all viewpoints. Our model accurately reconstructs the simulated 3D structure of the Sun, achieving a peak signal-to-noise ratio of 43.3 dB and a mean absolute relative error of 0.3\% for non-ecliptic viewpoints. Our method provides a consistent 3D reconstruction of the Sun from a limited number of viewpoints, thus highlighting the potential to create a virtual instrument for satellite observations of the Sun. Its extension to real observations will provide the missing link to compare the Sun to other stars and to improve space-weather forecasting.
Effects of Surface Elasticity on Mixed-Mode Fracture

Surface effects often significantly alter the physical and mechanical properties of nanosized materials and devices. In the present paper, we investigate the influence of surface elasticity on the mixed-mode fracture by a new finite element method with surface effects being incorporated. It is found that when the curvature radius at the crack root shrinks to nanometers, surface elasticity considerably affects the local stress distributions in the vicinity of the crack tip. Using the fracture criterion of maximum hoop stress, the influences of surface elasticity on the critical stress intensity factor and the propagation direction are addressed.