Search

Point Cloud Registration (PCR) is a fundamental and significant issue in photogrammetry and remote sensing, aiming to seek the optimal rigid transformation between sets of points. Achieving efficient and precise PCR poses a considerable challenge. We propose a novel micro-structures graph-based global point cloud registration method. The overall method is comprised of two stages. 1) Coarse registration (CR): We develop a graph incorporating micro-structures, employing an efficient graph-based hierarchical strategy to remove outliers for obtaining the maximal consensus set. We propose a robust GNC-Welsch estimator for optimization derived from a robust estimator to the outlier process in the Lie algebra space, achieving fast and robust alignment. 2) Fine registration (FR): To refine local alignment further, we use the octree approach to adaptive search plane features in the micro-structures. By minimizing the distance from the point-to-plane, we can obtain a more precise local alignment, and the process will also be addressed effectively by being treated as a planar adjustment algorithm combined with Anderson accelerated optimization (PA-AA). After extensive experiments on real data, our proposed method performs well on the 3DMatch and ETH datasets compared to the most advanced methods, achieving higher accuracy metrics and reducing the time cost by at least one-third.

Contextual bandits serve as a fundamental algorithmic framework for optimizing recommendation decisions online. Though extensive attention has been paid to tailoring contextual bandits for recommendation applications, the "herding effects" in user feedback have been ignored. These herding effects bias user feedback toward historical ratings, breaking down the assumption of unbiased feedback inherent in contextual bandits. This paper develops a novel variant of the contextual bandit that is tailored to address the feedback bias caused by the herding effects. A user feedback model is formulated to capture this feedback bias. We design the TS-Conf (Thompson Sampling under Conformity) algorithm, which employs posterior sampling to balance the exploration and exploitation tradeoff. We prove an upper bound for the regret of the algorithm, revealing the impact of herding effects on learning speed. Extensive experiments on datasets demonstrate that TS-Conf outperforms four benchmark algorithms. Analysis reveals that TS-Conf effectively mitigates the negative impact of herding effects, resulting in faster learning and improved recommendation accuracy., Comment: Published as a conference paper at PRICAI 2024

Online rating systems are often used in numerous web or mobile applications, e.g., Amazon and TripAdvisor, to assess the ground-truth quality of products. Due to herding effects, the aggregation of historical ratings (or historical collective opinion) can significantly influence subsequent ratings, leading to misleading and erroneous assessments. We study how to manage product ratings via rating aggregation rules and shortlisted representative reviews, for the purpose of correcting the assessment error. We first develop a mathematical model to characterize important factors of herding effects in product ratings. We then identify sufficient conditions (via the stochastic approximation theory), under which the historical collective opinion converges to the ground-truth collective opinion of the whole user population. These conditions identify a class of rating aggregation rules and review selection mechanisms that can reveal the ground-truth product quality. We also quantify the speed of convergence (via the martingale theory), which reflects the efficiency of rating aggregation rules and review selection mechanisms. We prove that the herding effects slow down the speed of convergence while an accurate review selection mechanism can speed it up. We also study the speed of convergence numerically and reveal trade-offs in selecting rating aggregation rules and review selection mechanisms. To show the utility of our framework, we design a maximum likelihood algorithm to infer model parameters from ratings, and conduct experiments on rating datasets from Amazon and TripAdvisor. We show that proper recency aware rating aggregation rules can improve the speed of convergence in Amazon and TripAdvisor by 41% and 62% respectively., Comment: 29 pages

Motivated by distributed selection problems, we formulate a new variant of multi-player multi-armed bandit (MAB) model, which captures stochastic arrival of requests to each arm, as well as the policy of allocating requests to players. The challenge is how to design a distributed learning algorithm such that players select arms according to the optimal arm pulling profile (an arm pulling profile prescribes the number of players at each arm) without communicating to each other. We first design a greedy algorithm, which locates one of the optimal arm pulling profiles with a polynomial computational complexity. We also design an iterative distributed algorithm for players to commit to an optimal arm pulling profile with a constant number of rounds in expectation. We apply the explore then commit (ETC) framework to address the online setting when model parameters are unknown. We design an exploration strategy for players to estimate the optimal arm pulling profile. Since such estimates can be different across different players, it is challenging for players to commit. We then design an iterative distributed algorithm, which guarantees that players can arrive at a consensus on the optimal arm pulling profile in only M rounds. We conduct experiments to validate our algorithm., Comment: 28 pages

We assess the relative strength of solar cycle (SC) 25 with respect to SCs 23 and 24 based on the abundance of halo coronal mass ejections (CMEs). We make use of the halo CME database (https://cdaw.gsfc.nasa.gov/CME_list/halo/halo.html) to compare the halo CME abundance during the first four years in each of SCs 23 to 25. The main result is that in several aspects such as the abundance, occurrence rate, source locations, and halo heights, halo CMEs are similar between SCs 24 and 25 but different from SC 23. This result follows from the fact that weaker cycles have low heliospheric total pressure, whose backreaction on CMEs allows them to expand more and hence enhancing the chance of becoming a halo. The solar cycle variation of halo CME properties is consistent with the precursor-based cycle prediction methods that indicate SC 25 is similar to or only slightly stronger than SC 24., Comment: 6 pages, 4 figures, 1 table, Proceedings of IAU Symposium 388

This paper provides an update on the coronal mass ejection (CME) catalog maintained at the CDAW Data Center, NASA Goddard Space Flight Center (https://cdaw.gsfc.nasa.gov/CME_list). This is version 2 (v2) of the Catalog that has been made as the default version as of May 1, 2024. The new features of the Catalog v2 are (i) online measurement tool, (ii) combination JavaScript movies from the STEREO and Solar Dynamics Observatory (SDO) missions, and (iii) insertion of newly identified CMEs for the period 1996 to 2004. The CME identification was revisited resulting in a set of $\sim$3000 new CMEs added to the Catalog. A vast majority of these CMEs are weak and narrow. The resulting statistical properties of CMEs are not significantly different from those reported using version 1., Comment: 6 pages, 6 figures, Proc. IAU Symposium 388

In the last twenty years, Structure from Motion (SfM) has been a constant research hotspot in the fields of photogrammetry, computer vision, robotics etc., whereas real-time performance is just a recent topic of growing interest. This work builds upon the original on-the-fly SfM (Zhan et al., 2024) and presents an updated version with three new advancements to get better 3D from what you capture: (i) real-time image matching is further boosted by employing the Hierarchical Navigable Small World (HNSW) graphs, thus more true positive overlapping image candidates are faster identified; (ii) a self-adaptive weighting strategy is proposed for robust hierarchical local bundle adjustment to improve the SfM results; (iii) multiple agents are included for supporting collaborative SfM and seamlessly merge multiple 3D reconstructions into a complete 3D scene when commonly registered images appear. Various comprehensive experiments demonstrate that the proposed SfM method (named on-the-fly SfMv2) can generate more complete and robust 3D reconstructions in a high time-efficient way. Code is available at http://yifeiyu225.github.io/on-the-flySfMv2.github.io/.

Recent advancements in graph learning have revolutionized the way to understand and analyze data with complex structures. Notably, Graph Neural Networks (GNNs), i.e. neural network architectures designed for learning graph representations, have become a popular paradigm. With these models being usually characterized by intuition-driven design or highly intricate components, placing them within the theoretical analysis framework to distill the core concepts, helps understand the key principles that drive the functionality better and guide further development. Given this surge in interest, this article provides a comprehensive summary of the theoretical foundations and breakthroughs concerning the approximation and learning behaviors intrinsic to prevalent graph learning models. Encompassing discussions on fundamental aspects such as expressiveness power, generalization, optimization, and unique phenomena such as over-smoothing and over-squashing, this piece delves into the theoretical foundations and frontier driving the evolution of graph learning. In addition, this article also presents several challenges and further initiates discussions on possible solutions., Comment: 35pages,273references. Github link: https://github.com/minehly/awesome-paper-for-graph-learning-theory

The Light Use Efficiency model, epitomized by the CASA model, is extensively applied in the quantitative estimation of vegetation Net Primary Productivity. However, the classic CASA model is marked by significant complexity: the estimation of environmental stress parameters, in particular, necessitates multi-source observation data, adding to the complexity and uncertainty of the model's operation. Additionally, the saturation effect of the Normalized Difference Vegetation Index (NDVI), a key variable in the CASA model, weakened the accuracy of CASA's NPP predictions in densely vegetated areas. To address these limitations, this study introduces the Exponential-CASA (EXP-CASA) model. The EXP-CASA model effectively improves the CASA model by using novel functions for estimating the fraction of absorbed photosynthetically active radiation (FPAR) and environmental stress, by utilizing long-term observational data from FLUXNET and MODIS surface reflectance data. In a comparative analysis of NPP estimation accuracy among four different NPP products, EXP-CASA ($R^2 = 0.68, RMSE= 1.1gC\cdot m^{-2} \cdot d^{-1}$) outperforms others, followed by GLASS-NPP, and lastly MODIS-NPP and classic CASA. Additionally, this research assesses the EXP-CASA model's adaptability to various vegetation indices, evaluates the sensitivity and stability of its parameters over time, and compares its accuracy against other leading NPP estimation products. The findings reveal that the EXP-CASA model exhibits strong adaptability to diverse vegetation indices and stability of model parameters over time series. By introducing a novel estimation approach that optimizes model construction, the EXP-CASA model remarkably improves the accuracy of NPP estimations and paves the way for global-scale, consistent, and continuous assessment of vegetation NPP.

We propose the electrical control of a device probing the Josephson effect in exciton-polariton (EP) condensates, which can be switched between various dynamical modes. We model the device by a four-component Gross-Pitaevskii equation assuming that ideal EP condensates are established with well-balanced pumping and dissipation. All the model parameters are calculated microscopically. In particular, we obtain the polariton tunneling strength across the junction as a second-order process of electron-hole pair tunneling. We find that the EP condensates can be manipulated through distinctive degrees of freedom not present in other coherent quantum systems, and the dynamics of EP Josephson junctions are far richer than that of the conventional superconducting junctions.

We study the problem of federated contextual combinatorial cascading bandits, where $|\mathcal{U}|$ agents collaborate under the coordination of a central server to provide tailored recommendations to the $|\mathcal{U}|$ corresponding users. Existing works consider either a synchronous framework, necessitating full agent participation and global synchronization, or assume user homogeneity with identical behaviors. We overcome these limitations by considering (1) federated agents operating in an asynchronous communication paradigm, where no mandatory synchronization is required and all agents communicate independently with the server, (2) heterogeneous user behaviors, where users can be stratified into $J \le |\mathcal{U}|$ latent user clusters, each exhibiting distinct preferences. For this setting, we propose a UCB-type algorithm with delicate communication protocols. Through theoretical analysis, we give sub-linear regret bounds on par with those achieved in the synchronous framework, while incurring only logarithmic communication costs. Empirical evaluation on synthetic and real-world datasets validates our algorithm's superior performance in terms of regrets and communication costs., Comment: Accepted by AAAI 2024

LLMs have marked a revolutonary shift, yet they falter when faced with compositional reasoning tasks. Our research embarks on a quest to uncover the root causes of compositional reasoning failures of LLMs, uncovering that most of them stem from the improperly generated or leveraged implicit reasoning results. Inspired by our empirical findings, we resort to Logit Lens and an intervention experiment to dissect the inner hidden states of LLMs. This deep dive reveals that implicit reasoning results indeed surface within middle layers and play a causative role in shaping the final explicit reasoning results. Our exploration further locates multi-head self-attention (MHSA) modules within these layers, which emerge as the linchpins in accurate generation and leveraing of implicit reasoning results. Grounded on the above findings, we develop CREME, a lightweight method to patch errors in compositional reasoning via editing the located MHSA modules. Our empirical evidence stands testament to CREME's effectiveness, paving the way for autonomously and continuously enhancing compositional reasoning capabilities in language models., Comment: Accepted by ACL'2024 Findings

Conditional coding has lately emerged as the mainstream approach to learned video compression. However, a recent study shows that it may perform worse than residual coding when the information bottleneck arises. Conditional residual coding was thus proposed, creating a new school of thought to improve on conditional coding. Notably, conditional residual coding relies heavily on the assumption that the residual frame has a lower entropy rate than that of the intra frame. Recognizing that this assumption is not always true due to dis-occlusion phenomena or unreliable motion estimates, we propose a masked conditional residual coding scheme. It learns a soft mask to form a hybrid of conditional coding and conditional residual coding in a pixel adaptive manner. We introduce a Transformer-based conditional autoencoder. Several strategies are investigated with regard to how to condition a Transformer-based autoencoder for inter-frame coding, a topic that is largely under-explored. Additionally, we propose a channel transform module (CTM) to decorrelate the image latents along the channel dimension, with the aim of using the simple hyperprior to approach similar compression performance to the channel-wise autoregressive model. Experimental results confirm the superiority of our masked conditional residual transformer (termed MaskCRT) to both conditional coding and conditional residual coding. On commonly used datasets, MaskCRT shows comparable BD-rate results to VTM-17.0 under the low delay P configuration in terms of PSNR-RGB and outperforms VTM-17.0 in terms of MS-SSIM-RGB. It also opens up a new research direction for advancing learned video compression., Comment: Accepted for Publication in IEEE Transactions on Circuits and Systems for Video Technology (TCSVT)

In a quantum Trojan-horse attack (THA), eavesdroppers learn encoded information by injecting bright light into encoded or decoded devices of quantum key distribution (QKD) systems. These attacks severely compromise the security of non-isolated systems. Thus, analytical security bound was derived in previous studies. However, these studies achieved poor performance unless the devices were strongly isolated. Here, we present a numerical method for achieving improved security bound for a decoy-state QKD system under THAs. The developed method takes advantage of the well-established numerical framework and significantly outperforms previous analytical bounds regarding the achievable final key and secure transmitted distance. The results provide a new tool for investigating the efficient security bounds of THA in practical decoy-state QKD systems. This study constitutes an important step toward securing QKD with real-life components., Comment: Comments are welecomed

This paper considers the out-of-distribution (OOD) generalization problem under the setting that both style distribution shift and spurious features exist and domain labels are missing. This setting frequently arises in real-world applications and is underlooked because previous approaches mainly handle either of these two factors. The critical challenge is decoupling style and spurious features in the absence of domain labels. To address this challenge, we first propose a structural causal model (SCM) for the image generation process, which captures both style distribution shift and spurious features. The proposed SCM enables us to design a new framework called IRSS, which can gradually separate style distribution and spurious features from images by introducing adversarial neural networks and multi-environment optimization, thus achieving OOD generalization. Moreover, it does not require additional supervision (e.g., domain labels) other than the images and their corresponding labels. Experiments on benchmark datasets demonstrate that IRSS outperforms traditional OOD methods and solves the problem of Invariant risk minimization (IRM) degradation, enabling the extraction of invariant features under distribution shift., Comment: 10 pages, 12 figures

Josephson tunneling in twisted cuprate junctions provides a litmus test for the pairing symmetry, which is fundamental for understanding the microscopic mechanism of high temperature superconductivity. This issue is rekindled by experimental advances in van der Waals stacking and the proposal of an emergent d+id-wave. So far, all experiments have been carried out on Bi$_2$Sr$_2$CaCu$_2$O$_{8+x}$ (Bi-2212) with double CuO$_2$ planes but show controversial results. Here, we investigate junctions made of Bi$_2$Sr$_{2-x}$La$_x$CuO$_{6+y}$ (Bi-2201) with single CuO$_2$ planes. Our on-site cold stacking technique ensures uncompromised crystalline quality and stoichiometry at the interface. Junctions with carefully calibrated twist angles around 45{\deg} show strong Josephson tunneling and conventional temperature dependence. Furthermore, we observe standard Fraunhofer diffraction patterns and integer Fiske steps in a junction with a twist angle of 45.0$\pm$0.2{\deg}. Together, these results pose strong constraints on the d or d+id-wave pairing and suggest an indispensable isotropic pairing component., Comment: 32 pages, 5 figures

Excitons are the neutral quasiparticles that form when Coulomb interactions create bound states between electrons and holes. Due to their bosonic nature, excitons are expected to condense and exhibit superfluidity at sufficiently low temperatures. In interacting Chern insulators, excitons may inherit the nontrivial topology and quantum geometry from the underlying electron wavefunctions. We theoretically investigate the excitonic bound states and superfluidity in flat-band insulators pumped with light. We find that the exciton wavefunctions exhibit vortex structures in momentum space, with the total vorticity being equal to the difference of Chern numbers between the conduction and valence bands. Moreover, both the exciton binding energy and the exciton superfluid density are proportional to the Brillouin-zone average of the quantum metric and the Coulomb potential energy per unit cell. Spontaneous emission of circularly polarized light from radiative decay is a detectable signature of the vorticity of excitons. We propose that the exciton vorticity can also be experimentally measured by the nonlinear anomalous Hall effect, whereas the exciton superfluidity can be detected by voltage-drop quantization through a combination of the quantum geometry and the Aharonov-Casher effect. Topological excitons and their superfluid phase could be realized in flat bands of twisted Van der Waals heterostructures., Comment: 25+3 pages, 3 figures

Interactive Recommender Systems (IRS) have been increasingly used in various domains, including personalized article recommendation, social media, and online advertising. However, IRS faces significant challenges in providing accurate recommendations under limited observations, especially in the context of interactive collaborative filtering. These problems are exacerbated by the cold start problem and data sparsity problem. Existing Multi-Armed Bandit methods, despite their carefully designed exploration strategies, often struggle to provide satisfactory results in the early stages due to the lack of interaction data. Furthermore, these methods are computationally intractable when applied to non-linear models, limiting their applicability. To address these challenges, we propose a novel method, the Interactive Graph Convolutional Filtering model. Our proposed method extends interactive collaborative filtering into the graph model to enhance the performance of collaborative filtering between users and items. We incorporate variational inference techniques to overcome the computational hurdles posed by non-linear models. Furthermore, we employ Bayesian meta-learning methods to effectively address the cold-start problem and derive theoretical regret bounds for our proposed method, ensuring a robust performance guarantee. Extensive experimental results on three real-world datasets validate our method and demonstrate its superiority over existing baselines.

It is known that the weak state of the heliosphere due to diminished solar activity in cycle 24 back-reacted on coronal mass ejections (CMEs) to make them appear wider for a given speed. One of the consequences of the weak state of the heliosphere is that more CMEs appear as halo CMEs (HCMEs), and halos are formed at shorter heliocentric distances. Current predictions for the strength of solar cycle (SC) 25 range from half to twice the strength of SC 24. We compare the HCME occurrence rate and other properties during the rise phase of cycles 23, 24, and 25 to weigh in on the strength of SC 25. We find that HCME and solar wind properties in SC 25 are intermediate between SCs 23 and 24, but closer to SC 24. The HCME occurrence rate, normalized to the sunspot number, is higher in SCs 24 and 25 than in SC 23. The solar wind total pressure in SC 25 is ~35% smaller than that in SC 23. Furthermore, the occurrence rates of high-energy solar energetic particle events and intense geomagnetic storms are well below the corresponding values in SC 23, but similar to those in SC 24. We conclude that cycle 25 is likely to be similar to or slightly stronger than cycle 24, in agreement with polar-field precursor methods for cycle 25 prediction, Comment: 11 pages, 5 figures, to appear in the Astrophysical Journal Letters