Miracle-dz/UniFAR-FTUs huggingface dataset:
Real-World Light Field Image Super-Resolution via Degradation Modulation

Recent years have witnessed the great advances of deep neural networks (DNNs) in light field (LF) image super-resolution (SR). However, existing DNN-based LF image SR methods are developed on a single fixed degradation (e.g., bicubic downsampling), and thus cannot be applied to super-resolve real LF images with diverse degradation. In this paper, we propose a simple yet effective method for real-world LF image SR. In our method, a practical LF degradation model is developed to formulate the degradation process of real LF images. Then, a convolutional neural network is designed to incorporate the degradation prior into the SR process. By training on LF images using our formulated degradation, our network can learn to modulate different degradation while incorporating both spatial and angular information in LF images. Extensive experiments on both synthetically degraded and real-world LF images demonstrate the effectiveness of our method. Compared with existing state-of-the-art single and LF image SR methods, our method achieves superior SR performance under a wide range of degradation, and generalizes better to real LF images. Codes and models are available at https://yingqianwang.github. io/LF-DMnet/.
ATDN vSLAM: An all-through Deep Learning-Based Solution for Visual Simultaneous Localization and Mapping

In this paper, a novel solution is introduced for visual Simultaneous Localization and Mapping (vSLAM) that is built up of Deep Learning components. The proposed architecture is a highly modular framework in which each component offers state of the art results in their respective fields of vision-based Deep Learning solutions. The paper shows that with the synergic integration of these individual building blocks, a functioning and efficient all-through deep neural (ATDN) vSLAM system can be created. The Embedding Distance Loss function is introduced and using it the ATDN architecture is trained. The resulting system managed to achieve 4.4% translation and 0.0176 deg/m rotational error on a subset of the KITTI dataset. The proposed architecture can be used for efficient and low-latency autonomous driving (AD) aiding database creation as well as a basis for autonomous vehicle (AV) control.
New Identifications and Multiwavelength Properties of Extragalactic Fermi Gamma-Ray Sources in the SPT-SZ Survey Field

The fourth Fermi Large Area Telescope catalog (4FGL) contains 5064 γ-ray sources detected at high significance, but 26% of them still lack associations at other wavelengths. The SPT-SZ survey, conducted between 2008 and 2011 with the South Pole Telescope (SPT), covers 2500 deg2 of the southern sky in three millimeter-wavelength (mm) bands and was used to construct a catalog of nearly 5000 emissive sources. In this study, we introduce a new cross-matching scheme to search for multiwavelength counterparts of extragalactic γ-ray sources using a mm catalog. We apply a Poissonian probability to evaluate the rate of spurious false associations and compare the multiwavelength associations from the radio, mm, near-infrared, and X-ray with 4FGL γ-ray sources. In the SPT-SZ survey field, 85% of 4FGL sources are associated with mm counterparts. These mm sources include 94% of previously associated 4FGL sources and 56% of previously unassociated 4FGL sources. The latter group contains 40 4FGL sources for which SPT has provided the first identified counterparts. Nearly all of the SPT-associated 4FGL sources can be described as flat-spectrum radio quasars or blazars. We find that the mm band is the most efficient wavelength for detecting γ-ray blazars when considering both completeness and purity. We also demonstrate that the mm band correlates better to the γ-ray band than the radio or X-ray bands. With the next generation of CMB experiments, this technique can be extended to greater sensitivities and more sky area to further complete the identifications of the remaining unknown γ-ray blazars.
Quantum dynamics of a 
4π
 kink in Josephson junction parallel arrays with large kinetic inductance

We present a theoretical study of the quantum dynamics of two magnetic ﬂuxons (MFs) trapped in Josephson junction parallel arrays (JJPAs) with large kinetic inductances. The Josephson phase distribution of two trapped MFs satisﬁes a topological constraint, i.e., a total variation of Josephson phases along a JJPA is 4 π . In such JJPAs the characteristic length of Josephson phase distribution (”the size” of MF) is drastically reduced to be less than a single cell size. Two extreme dynamic patterns will be distinguished: two weakly interacting MFs and two merged MFs, i.e., a 4 π –kink. Taking into account the repulsive interaction between two MFs located in the same or adjacent cells we obtain the energy band spectrum E 4 π ( p ) for a quantum 4 π –kink. The coherent quantum dynamics of a 4 π –kink demonstrates the quantum beats with the frequency and amplitude strongly deviating from ones observed for two independent MFs. In the presence of applied dc and ac bias current of frequency f a weakly incoherent quantum dynamics of a 4 π -kink results in the Bloch oscillations and the seminal current steps with values I ( n ) 4 π = enf which are two times less than ones for two independent MFs.
Subleading contributions to 
N
-boson systems inside the universal window

We study bosonic systems in the regime in which the two-body system has a shallow bound state or, equivalently, a large value of the two-body scattering length. Using the eﬀective ﬁeld theory framework as a guidance, we construct a series of potential terms which have a decreasing importance in the description of the binding energy of the systems. The leading order potential terms consist in a two-body term, usually attractive, plus a three-body term, usually repulsive; this last term is required to prevent the collapse of systems with more than two particles. At this order, the parametrization of the two-body potential is done to obtain a correct description of the scattering length, which governs the dynamics in this regime, whereas the three-body term ﬁxes a three-body datum. We investigate the role of the cut-oﬀ in the leading order description and we extend the exploration beyond the leading order by including the next-to-leading order terms in both, the two- and three-body potentials. We use the requirement of the stability of the N -body system, whose energy is variationally estimated, to introduce the three-body forces. The potential parametrization, as a function of the cut-oﬀ, is ﬁxed to describe the energy of 4 He clusters up to seven particles within the expected accuracy. Finally, we also explore the possibility to describe at the same time the atom-dimer scattering length.
A Survey on Automated Driving System Testing: Landscapes and Trends

Automated Driving Systems (ADS) have made great achievements in recent years thanks to the efforts from both academia and industry. A typical ADS is composed of multiple modules, including sensing, perception, planning, and control, which brings together the latest advances in different domains. Despite these achievements, safety assurance of ADS is of great significance, since unsafe behavior of ADS can bring catastrophic consequences. Testing has been recognized as an important system validation approach that aims to expose unsafe system behavior; however, in the context of ADS, it is extremely challenging to devise effective testing techniques, due to the high complexity and multidisciplinarity of the systems. There has been great much literature that focuses on the testing of ADS, and a number of surveys have also emerged to summarize the technical advances. Most of the surveys focus on the system-level testing performed within software simulators, and they thereby ignore the distinct features of different modules. In this article, we provide a comprehensive survey on the existing ADS testing literature, which takes into account both module-level and system-level testing. Specifically, we make the following contributions: (1) We survey the module-level testing techniques for ADS and highlight the technical differences affected by the features of different modules; (2) we also survey the system-level testing techniques, with focuses on the empirical studies that summarize the issues occurring in system development or deployment, the problems due to the collaborations between different modules, and the gap between ADS testing in simulators and the real world; and (3) we identify the challenges and opportunities in ADS testing, which pave the path to the future research in this field.
Finite-Time Analysis of Decentralized Single-Timescale Actor-Critic

Decentralized Actor-Critic (AC) algorithms have been widely utilized for multi-agent reinforcement learning (MARL) and have achieved remarkable success. Apart from its empirical success, the theoretical convergence property of decentralized AC algorithms is largely unexplored. Most of the existing finite-time convergence results are derived based on either double-loop update or two-timescale step sizes rule, and this is the case even for centralized AC algorithm under a single-agent setting. In practice, the \emph{single-timescale} update is widely utilized, where actor and critic are updated in an alternating manner with step sizes being of the same order. In this work, we study a decentralized \emph{single-timescale} AC algorithm.Theoretically, using linear approximation for value and reward estimation, we show that the algorithm has sample complexity of $\tilde{\mathcal{O}}(\varepsilon^{-2})$ under Markovian sampling, which matches the optimal complexity with a double-loop implementation (here, $\tilde{\mathcal{O}}$ hides a logarithmic term). When we reduce to the single-agent setting, our result yields new sample complexity for centralized AC using a single-timescale update scheme. The central to establishing our complexity results is \emph{the hidden smoothness of the optimal critic variable} we revealed. We also provide a local action privacy-preserving version of our algorithm and its analysis. Finally, we conduct experiments to show the superiority of our algorithm over the existing decentralized AC algorithms.
Convex Quantization Preserves Logconcavity

A logconcave likelihood is as important to proper statistical inference as a convex cost function is important to variational optimization. Quantization is often disregarded when writing likelihood models, ignoring the limitations of the physical detectors used to collect the data. These two facts call for the question: would including quantization in likelihood models preclude logconcavity? are the true data likelihoods logconcave? We provide a general proof that the same simple assumption that leads to logconcave continuous-data likelihoods also leads to logconcave quantized-data likelihoods, provided that convex quantization regions are used.
Singular Value Fine-tuning: Few-shot Segmentation requires Few-parameters Fine-tuning

Freezing the pre-trained backbone has become a standard paradigm to avoid overfitting in few-shot segmentation. In this paper, we rethink the paradigm and explore a new regime: {\em fine-tuning a small part of parameters in the backbone}. We present a solution to overcome the overfitting problem, leading to better model generalization on learning novel classes. Our method decomposes backbone parameters into three successive matrices via the Singular Value Decomposition (SVD), then {\em only fine-tunes the singular values} and keeps others frozen. The above design allows the model to adjust feature representations on novel classes while maintaining semantic clues within the pre-trained backbone. We evaluate our {\em Singular Value Fine-tuning (SVF)} approach on various few-shot segmentation methods with different backbones. We achieve state-of-the-art results on both Pascal-5$^i$ and COCO-20$^i$ across 1-shot and 5-shot settings. Hopefully, this simple baseline will encourage researchers to rethink the role of backbone fine-tuning in few-shot settings. The source code and models will be available at https://github.com/syp2ysy/SVF.
Dealing with Sparse Rewards in Continuous Control Robotics via Heavy-Tailed Policies

In this paper, we present a novel Heavy-Tailed Stochastic Policy Gradient (HT-PSG) algorithm to deal with the challenges of sparse rewards in continuous control problems. Sparse reward is common in continuous control robotics tasks such as manipulation and navigation, and makes the learning problem hard due to non-trivial estimation of value functions over the state space. This demands either reward shaping or expert demonstrations for the sparse reward environment. However, obtaining high-quality demonstrations is quite expensive and sometimes even impossible. We propose a heavy-tailed policy parametrization along with a modified momentum-based policy gradient tracking scheme (HT-SPG) to induce a stable exploratory behavior to the algorithm. The proposed algorithm does not require access to expert demonstrations. We test the performance of HT-SPG on various benchmark tasks of continuous control with sparse rewards such as 1D Mario, Pathological Mountain Car, Sparse Pendulum in OpenAI Gym, and Sparse MuJoCo environments (Hopper-v2). We show consistent performance improvement across all tasks in terms of high average cumulative reward. HT-SPG also demonstrates improved convergence speed with minimum samples, thereby emphasizing the sample efficiency of our proposed algorithm.
Dynamics of Opinion Polarization

For decades, researchers have been trying to understand how people form their opinions. This quest has become even more pressing with the widespread usage of online social networks and social media, which seem to amplify the already existing phenomenon of polarization. In this work, we study the problem of polarization assuming that opinions evolve according to the popular Friedkin–Johnsen (FJ) model. The FJ model is one of the few existing opinion dynamics models that has been validated on small/medium-sized social groups. First, we carry out a comprehensive survey of the FJ model in the literature (distinguishing its main variants) and of the many polarization metrics available, deriving an invariant relation among them. Second, we derive the conditions under which the FJ variants are able to induce opinion polarization in a social network, as a function of the social ties between the nodes and their individual susceptibility to the opinion of others. Third, we discuss a methodology for finding concrete opinion vectors that are able to bring the network to a polarized state. Finally, our analytical results are applied to two real social network graphs, showing how our theoretical findings can be used to identify polarizing conditions under various configurations.
Lalaine: Measuring and Characterizing Non-Compliance of Apple Privacy Labels at Scale

As a key supplement to privacy policies that are known to be lengthy and difficult to read, Apple has launched the app privacy labels, which purportedly help users more easily understand an app's privacy practices. However, false and misleading privacy labels can dupe privacy-conscious consumers into downloading data-intensive apps, ultimately eroding the credibility and integrity of the labels. Although Apple releases requirements and guidelines for app developers to create privacy labels, little is known about whether and to what extent the privacy labels in the wild are correct and compliant, reflecting the actual data practices of iOS apps. This paper presents the first systematic study, based on our new methodology named Lalaine, to evaluate data-flow to privacy-label (flow-to-label) consistency. Lalaine analyzed the privacy labels and binaries of 5,102 iOS apps, shedding light on the prevalence and seriousness of privacy-label non-compliance. We provide detailed case studies and analyze root causes for privacy label non-compliance that complements prior understandings. This has led to new insights for improving privacy-label design and compliance requirements, so app developers, platform stakeholders, and policy-makers can better achieve their privacy and accountability goals. Lalaine is thoroughly evaluated for its high effectiveness and efficiency. We are responsibly reporting the results to stakeholders.
Testing Ocean Software with Metamorphic Testing

Advancing ocean science has a significant impact to the development of the world, from operating a safe navigation for vessels to maintaining a healthy and diverse ocean ecosystem. Various ocean software systems have been extensively adopted for differ-ent purposes, for instance, predicting hourly sea level elevation across shorelines, simulating large-scale ocean circulations, as well as integrating into Earth system models for weather forecasts and climate projections. Regardless of their significance, guaranteeing the trustworthiness of ocean software and modelling systems is a long-standing challenge. The testing of ocean software suffers a lot from the socalled oracle problem, which refers to the absence of test oracles mainly due to the nonlinear interactions of multiple physical variables and the high complexity in computation. In the ocean, observed tidal signals are distorted by non-deterministic physical variables, hindering us from knowing the “true” astronom-ical tidal constituents existing in the timeseries. In this paper, we present how to test tidal analysis and prediction (TAP) software based on metamorphic testing (MT), a simple yet effective testing approach to the oracle problem. In particular, we construct meta-morphic relations from the periodic property of astronomical tide, and then use them to successfully detect a real-life defect in an open-source TAP software. We also conduct a series of experiments to further demonstrate the applicability and effectiveness of MT in the testing of TAP software. Our study not only justifies the poten-tial of MT in testing more complex ocean software and modelling systems, but also can be expanded to assess and improve the quality of a broader range of scientific simulation software systems.
Learned reconstruction with convergence guarantees

In recent years, deep learning has achieved remarkable empirical success for image reconstruction. This has catalyzed an ongoing quest for precise characterization of correctness and reliability of data-driven methods in critical use-cases, for instance in medical imaging. Notwithstanding the excellent performance and efﬁcacy of deep learning-based methods, concerns have been raised regarding their stability, or lack thereof, with serious practical implications. Signiﬁcant advances have been made in recent years to unravel the inner workings of data-driven image recovery methods, challenging their widely perceived black-box nature. In this article, we will specify relevant notions of convergence for data-driven image reconstruction, which will form the basis of a survey of learned methods with mathematically rigorous reconstruction guarantees. An example that is highlighted is the role of input-convex neural networks (ICNNs), offering the possibility to combine the power of deep learning with classical convex regularization theory for devising methods that are provably convergent. This survey article is aimed at both methodological researchers seeking to advance the frontiers of our understanding of data-driven image reconstruction methods as well as practitioners, by providing an accessible description of convergence concepts and by placing some of the existing empirical practices on a solid mathematical foundation.
Graph Comparison Based on Adjacency Function Matrix

In this paper, we present a new metric distance for comparing two large graphs to find similarities and differences between them based on one of the most important graph structural properties, which is Node Adjacency Information, for all vertices in the graph. Then, we defined a new function and some parameters to find the distance of two large graphs using different neighbors of vertices. There are some methods which they focused on the other features of graphs to obtain the distance between them, but some of them are Node Correspondence which means their node set have the same size. However, in this paper, we introduce a new method which can find the distance between two large graphs with different size of node set.
Towards Constructing Finer then Homotopy Path Classes

This work presents a new path classification criterion to distinguish paths geometrically and topologically from the workspace, which is divided through cell decomposition, generating a medial-axis-like skeleton structure. We use this information as well as the topology of the robot to bound and classify different paths in the configuration space. We show that the path class found by the proposed method is equivalent to and finer than the path class defined by the homotopy of paths. The proposed path classes are easy to compute, compare, and can be used for various planning purposes. The classification builds heavily upon the topology of the robot and the geometry of the workspace, leading to an alternative fiber-bundle-based description of the configuration space. We introduce a planning framework to overcome obstacles and narrow passages using the proposed path classification method and the resulting path classes.