Search

In many-body systems with U(1) global symmetry, the charge fluctuations in a subregion reveal important insights into entanglement and other global properties. For subregions with sharp corners, bipartite fluctuations have been predicted to exhibit a universal shape dependence on the corner angle in certain quantum phases and transitions, characterized by a "universal angle function" and a "universal coefficient." However, we demonstrate that this simple formula is insufficient for charge insulators, including composite fermi liquids. In these systems, the corner contribution may depend on the corner angle, subregion orientation, and other microscopic details. We provide an infinite series representation of the corner term, introducing orientation-resolved universal angle functions with their non-universal coefficients. In the small-angle limit or under orientation averaging, the remaining terms' coefficients are fully determined by the many-body quantum metric, which, while not universal, adheres to both a universal topological lower bound and an energetic upper bound. We also clarify the conditions for bound saturation in (anisotropic) Landau levels, leveraging the generalized Kohn theorem and holomorphic properties of many-body wavefunctions. We find that a broad class of fractional quantum Hall wavefunctions, including unprojected parton states and composite-fermion Fermi sea wavefunctions, saturates the bounds., Comment: 32 pages, 7 figures

In enterprise data pipelines, data insertions occur periodically and may impact downstream services if data quality issues are not addressed. Typically, such problems can be investigated and fixed by on-call engineers, but locating the cause of such problems and fixing errors are often time-consuming. Therefore, automatic data validation is a better solution to defend the system and downstream services by enabling early detection of errors and providing detailed error messages for quick resolution. This paper proposes a self-validate data management system with automatic pattern discovery techniques to verify the correctness of semi-structural string data in enterprise data pipelines. Our solution extracts patterns from historical data and detects erroneous incoming data in a top-down fashion. High-level information of historical data is analyzed to discover the format skeleton of correct values. Fine-grained semantic patterns are then extracted to strike a balance between generalization and specification of the discovered pattern, thus covering as many correct values as possible while avoiding over-fitting. To tackle cold start and rapid data growth, we propose an incremental update strategy and example generalization strategy. Experiments on large-scale industrial and public datasets demonstrate the effectiveness and efficiency of our method compared to alternative solutions. Furthermore, a case study on an industrial platform (Ant Group Inc.) with thousands of applications shows that our system captures meaningful data patterns in daily operations and helps engineers quickly identify errors.

In this paper, we fully resolve two major conjectures on odd edge-colorings and odd edge-coverings of graphs, proposed by Petru{\v{s}}evski and {\v{S}}krekovski ({\it European Journal of Combinatorics,} 91:103225, 2021). The first conjecture states that for any loopless and connected graph $G$ with $\chi_{\text{odd}}'(G)=4$, there exists an edge $e$ such that $G\backslash \{e\}$ is odd $3$-edge-colorable. The second conjecture states that any simple graph $G$ with $\chi_{\text{odd}}'(G)=4$ admits an odd $3$-edge-covering in which only one edge receives two or three colors. In addition, we strongly confirm the second conjecture by demonstrating that there exists an odd $3$-edge-covering in which only one edge receives two colors., Comment: 15 pages

Bulk topology and criticality can both lead to nontrivial boundary effects. Topological orders are often characterized by their robust edge states, while bulk critical points can have different boundary scalings governed by boundary conditions. The interplay between these two different boundary effects is an intriguing problem. The boundary of the deconfined quantum critical point (DQCP) is the ideal platform for the interplay of the two boundary effects, as the DQCP is also an intrinsically gapless symmetry protected topological (igSPT) state. In this work we discuss the boundary of several analogues of the DQCP. We demonstrate that the fluctuation of the bulk order parameters and their various boundary conditions lead to a rich possibility of the edge states, including a "pseudogap" (or super power-law decay) behavior. We also discuss the quantum information perspective of our work, i.e. the implication of our results on DQCP under weak-measurement. Weak-measurement followed by post-selection can change the boundary condition at the temporal boundary in the path-integral representation of a density matrix, which will lead to different behaviors of the "strange correlator"., Comment: 9 pages

Benchmarking is crucial for evaluating a DBMS, yet existing benchmarks often fail to reflect the varied nature of user workloads. As a result, there is increasing momentum toward creating databases that incorporate real-world user data to more accurately mirror business environments. However, privacy concerns deter users from directly sharing their data, underscoring the importance of creating synthesized databases for benchmarking that also prioritize privacy protection. Differential privacy has become a key method for safeguarding privacy when sharing data, but the focus has largely been on minimizing errors in aggregate queries or classification tasks, with less attention given to benchmarking factors like runtime performance. This paper delves into the creation of privacy-preserving databases specifically for benchmarking, aiming to produce a differentially private database whose query performance closely resembles that of the original data. Introducing PrivBench, an innovative synthesis framework, we support the generation of high-quality data that maintains privacy. PrivBench uses sum-product networks (SPNs) to partition and sample data, enhancing data representation while securing privacy. The framework allows users to adjust the detail of SPN partitions and privacy settings, crucial for customizing privacy levels. We validate our approach, which uses the Laplace and exponential mechanisms, in maintaining privacy. Our tests show that PrivBench effectively generates data that maintains privacy and excels in query performance, consistently reducing errors in query execution time, query cardinality, and KL divergence.

In this work, we study the inverse spectral problems for the Sturm-Liouville operators on [0,1] with complex coefficients and a discontinuity at $x=a\in(0,1)$. Assume that the potential on (a,1) and some parameters in the discontinuity and boundary conditions are given. We recover the potential on (0,a) and the other parameters from the eigenvalues. This is the so-called partial inverse problem. The local solvability and stability of the partial inverse problems are obtained for $a\in(0,1)$, in which the error caused by the given partial potential is considered. As a by-product, we also obtain two new uniqueness theorems for the partial inverse problem., Comment: 26 pages

Fluctuations of conserved quantities within a subsystem are non-local observables that provide unique insights into quantum many-body systems. In this paper, we explore the behaviors of bipartite charge (and spin) fluctuations across interaction-driven "metal-insulator transitions" out of Landau Fermi liquids. The "charge insulators" include a class of non-Fermi-liquid states of fractionalized degrees of freedom, such as compressible composite Fermi liquids (for spinless electrons) and incompressible spin-liquid Mott insulators (for spin-$1/2$ electrons). We find that charge fluctuations $F$ exhibit distinct leading-order scalings across the phase transition: $F \sim L\log(L)$ in Landau Fermi liquids and $F \sim L$ in charge insulators, where $L$ is the linear size of the subsystem under bipartition. In the case of composite Fermi liquids (under certain conditions), we also identify a universal constant term $-f(\theta)|\sigma_{xy}|/(2\pi)$ arising when the subsystem geometry incorporates a sharp corner. Here, $f(\theta)$ represents a function of the corner angle, and $\sigma_{xy}$ denotes the Hall conductivity. At the critical point of each example, provided the transition is continuous, we find that the leading-order scaling $F \sim L$ is accompanied by a subleading universal corner contribution $-\log(L)f(\theta)C_{\rho}/2$ with the same angle dependence $f(\theta)$. The universal coefficient $C_{\rho}$ is linked to the predicted universal longitudinal (and Hall) resistivity jump $\Delta\rho_{xx}$ (and $\Delta\rho_{xy}$) at the critical point., Comment: 26 pages, 4 figures; updated discussion on charge insulators

This paper introduces a novel approach using Large Language Models (LLMs) integrated into an agent framework for flexible and effective personal mobility generation. LLMs overcome the limitations of previous models by effectively processing semantic data and offering versatility in modeling various tasks. Our approach addresses three research questions: aligning LLMs with real-world urban mobility data, developing reliable activity generation strategies, and exploring LLM applications in urban mobility. The key technical contribution is a novel LLM agent framework that accounts for individual activity patterns and motivations, including a self-consistency approach to align LLMs with real-world activity data and a retrieval-augmented strategy for interpretable activity generation. We evaluate our LLM agent framework and compare it with state-of-the-art personal mobility generation approaches, demonstrating the effectiveness of our approach and its potential applications in urban mobility. Overall, this study marks the pioneering work of designing an LLM agent framework for activity generation based on real-world human activity data, offering a promising tool for urban mobility analysis., Comment: Source codes are available at https://github.com/Wangjw6/LLMob/

Large Language Models (LLMs) have increasingly been utilized in social simulations, where they are often guided by carefully crafted instructions to stably exhibit human-like behaviors during simulations. Nevertheless, we doubt the necessity of shaping agents' behaviors for accurate social simulations. Instead, this paper emphasizes the importance of spontaneous phenomena, wherein agents deeply engage in contexts and make adaptive decisions without explicit directions. We explored spontaneous cooperation across three competitive scenarios and successfully simulated the gradual emergence of cooperation, findings that align closely with human behavioral data. This approach not only aids the computational social science community in bridging the gap between simulations and real-world dynamics but also offers the AI community a novel method to assess LLMs' capability of deliberate reasoning., Comment: Source codes available at https://github.com/wuzengqing001225/SABM_ShallWeTeamUp

Approximate nearest neighbor search (ANNS) in high-dimensional spaces is a pivotal challenge in the field of machine learning. In recent years, graph-based methods have emerged as the superior approach to ANNS, establishing a new state of the art. Although various optimizations for graph-based ANNS have been introduced, they predominantly rely on heuristic methods that lack formal theoretical backing. This paper aims to enhance routing within graph-based ANNS by introducing a method that offers a probabilistic guarantee when exploring a node's neighbors in the graph. We formulate the problem as probabilistic routing and develop two baseline strategies by incorporating locality-sensitive techniques. Subsequently, we introduce PEOs, a novel approach that efficiently identifies which neighbors in the graph should be considered for exact distance calculation, thus significantly improving efficiency in practice. Our experiments demonstrate that equipping PEOs can increase throughput on commonly utilized graph indexes (HNSW and NSSG) by a factor of 1.6 to 2.5, and its efficiency consistently outperforms the leading-edge routing technique by 1.1 to 1.4 times., Comment: Source code is available at https://github.com/ICML2024-code/PEOs

The learnware paradigm proposed by Zhou [2016] aims to enable users to reuse numerous existing well-trained models instead of building machine learning models from scratch, with the hope of solving new user tasks even beyond models' original purposes. In this paradigm, developers worldwide can submit their high-performing models spontaneously to the learnware dock system (formerly known as learnware market) without revealing their training data. Once the dock system accepts the model, it assigns a specification and accommodates the model. This specification allows the model to be adequately identified and assembled to reuse according to future users' needs, even if they have no prior knowledge of the model. This paradigm greatly differs from the current big model direction and it is expected that a learnware dock system housing millions or more high-performing models could offer excellent capabilities for both planned tasks where big models are applicable; and unplanned, specialized, data-sensitive scenarios where big models are not present or applicable. This paper describes Beimingwu, the first open-source learnware dock system providing foundational support for future research of learnware paradigm.The system significantly streamlines the model development for new user tasks, thanks to its integrated architecture and engine design, extensive engineering implementations and optimizations, and the integration of various algorithms for learnware identification and reuse. Notably, this is possible even for users with limited data and minimal expertise in machine learning, without compromising the raw data's security. Beimingwu supports the entire process of learnware paradigm. The system lays the foundation for future research in learnware-related algorithms and systems, and prepares the ground for hosting a vast array of learnwares and establishing a learnware ecosystem.

This paper explores the utilization of LLMs for data preprocessing (DP), a crucial step in the data mining pipeline that transforms raw data into a clean format conducive to easy processing. Whereas the use of LLMs has sparked interest in devising universal solutions to DP, recent initiatives in this domain typically rely on GPT APIs, raising inevitable data breach concerns. Unlike these approaches, we consider instruction-tuning local LLMs (7 -- 13B models) as universal DP task solvers that operate on a local, single, and low-priced GPU, ensuring data security and enabling further customization. We select a collection of datasets across four representative DP tasks and construct instruction tuning data using data configuration, knowledge injection, and reasoning data distillation techniques tailored to DP. By tuning Mistral-7B, Llama 3-8B, and OpenOrca-Platypus2-13B, our models, namely, Jellyfish-7B/8B/13B, deliver competitiveness compared to GPT-3.5/4 models and strong generalizability to unseen tasks while barely compromising the base models' abilities in NLP tasks. Meanwhile, Jellyfish offers enhanced reasoning capabilities compared to GPT-3.5. Our models are available at: https://huggingface.co/NECOUDBFM/Jellyfish . Our instruction dataset is available at: https://huggingface.co/datasets/NECOUDBFM/Jellyfish-Instruct ., Comment: a.k.a. "Jellyfish: Instruction-Tuning Local Large Language Models for Data Preprocessing''

While the GeV $\gamma$-ray emission of starburst galaxies (SBG) is commonly thought to arise from hadronic interactions between accelerated cosmic rays and interstellar gas, the origin of the TeV $\gamma$-ray emission is more uncertain. One possibility is that a population of pulsar wind nebulae (PWNe) in these galaxies could be responsible for the TeV $\gamma$-ray emission. In this work, we first synthesize a PWNe population in the Milky Way, and assessed their contribution to the $\gamma$-ray emission of the Galaxy, using a time-dependent model to calculate the evolution of the PWN population. Such synthetic PWN population can reproduce the flux distribution of identified PWNe in the Milky Way given a distribution of the initial state of the pulsar population. We then apply it to starburst galaxies and quantitatively calculate the spectral energy distribution of all PWNe in the SBG NGC 253 and M82. We propose that TeV $\gamma$-ray emission in starburst galaxies can be dominated by PWNe for a wide range of parameter space. The energetic argument requires that $\eta_e \times v_{\rm SN} > 0.01 {\rm yr}^{-1}$, where $\eta_e$ is the fraction the spin-down energy going to electrons and $v_{\rm SN}$ is the supernova rate. By requiring the synchrotron emission flux of all PWNe in the galaxy not exceeding the hard X-ray measurement of NGC 253, we constrain the initial magnetic field strength of PWNe to be $< 400 \mu$G. Future observations at higher energies with LHAASO or next-generation neutrino observatory IceCube-Gen2 will help us to understand better the origin of the TeV $\gamma$-ray emission in SBGs., Comment: 9 pages, 8 figures

Machine-generated data is rapidly growing and poses challenges for data-intensive systems, especially as the growth of data outpaces the growth of storage space. To cope with the storage issue, compression plays a critical role in storage engines, particularly for data-intensive applications, where high compression ratios and efficient random access are essential. However, existing compression techniques tend to focus on general-purpose and data block approaches, but overlook the inherent structure of machine-generated data and hence result in low-compression ratios or limited lookup efficiency. To address these limitations, we introduce the Pattern-Based Compression (PBC) algorithm, which specifically targets patterns in machine-generated data to achieve Pareto-optimality in most cases. Unlike traditional data block-based methods, PBC compresses data on a per-record basis, facilitating rapid random access. Our experimental evaluation demonstrates that PBC, on average, achieves a compression ratio twice as high as state-of-the-art techniques while maintaining competitive compression and decompression speeds.We also integrate PBC to a production database system and achieve improvement on both comparison ratio and throughput.

There is a considerable body of work on data cleaning which employs various principles to rectify erroneous data and transform a dirty dataset into a cleaner one. One of prevalent approaches is probabilistic methods, including Bayesian methods. However, existing probabilistic methods often assume a simplistic distribution (e.g., Gaussian distribution), which is frequently underfitted in practice, or they necessitate experts to provide a complex prior distribution (e.g., via a programming language). This requirement is both labor-intensive and costly, rendering these methods less suitable for real-world applications. In this paper, we propose BClean, a Bayesian Cleaning system that features automatic Bayesian network construction and user interaction. We recast the data cleaning problem as a Bayesian inference that fully exploits the relationships between attributes in the observed dataset and any prior information provided by users. To this end, we present an automatic Bayesian network construction method that extends a structure learning-based functional dependency discovery method with similarity functions to capture the relationships between attributes. Furthermore, our system allows users to modify the generated Bayesian network in order to specify prior information or correct inaccuracies identified by the automatic generation process. We also design an effective scoring model (called the compensative scoring model) necessary for the Bayesian inference. To enhance the efficiency of data cleaning, we propose several approximation strategies for the Bayesian inference, including graph partitioning, domain pruning, and pre-detection. By evaluating on both real-world and synthetic datasets, we demonstrate that BClean is capable of achieving an F-measure of up to 0.9 in data cleaning, outperforming existing Bayesian methods by 2% and other data cleaning methods by 15%., Comment: Our source code is available at https://github.com/yyssl88/BClean

Computer simulations offer a robust toolset for exploring complex systems across various disciplines. A particularly impactful approach within this realm is Agent-Based Modeling (ABM), which harnesses the interactions of individual agents to emulate intricate system dynamics. ABM's strength lies in its bottom-up methodology, illuminating emergent phenomena by modeling the behaviors of individual components of a system. Yet, ABM has its own set of challenges, notably its struggle with modeling natural language instructions and common sense in mathematical equations or rules. This paper seeks to transcend these boundaries by integrating Large Language Models (LLMs) like GPT into ABM. This amalgamation gives birth to a novel framework, Smart Agent-Based Modeling (SABM). Building upon the concept of smart agents -- entities characterized by their intelligence, adaptability, and computation ability -- we explore in the direction of utilizing LLM-powered agents to simulate real-world scenarios with increased nuance and realism. In this comprehensive exploration, we elucidate the state of the art of ABM, introduce SABM's potential and methodology, and present three case studies (source codes available at https://github.com/Roihn/SABM), demonstrating the SABM methodology and validating its effectiveness in modeling real-world systems. Furthermore, we cast a vision towards several aspects of the future of SABM, anticipating a broader horizon for its applications. Through this endeavor, we aspire to redefine the boundaries of computer simulations, enabling a more profound understanding of complex systems., Comment: Source codes are available at https://github.com/Roihn/SABM

Large Language Models (LLMs), typified by OpenAI's GPT series and Meta's LLaMA variants, have marked a significant advancement in artificial intelligence. Trained on vast amounts of text data, LLMs are capable of understanding and generating human-like text across a diverse range of topics. This study expands on the applications of LLMs, exploring their potential in data preprocessing, a critical stage in data mining and analytics applications. We delve into the applicability of state-of-the-art LLMs such as GPT-3.5, GPT-4, and Vicuna-13B for error detection, data imputation, schema matching, and entity matching tasks. Alongside showcasing the inherent capabilities of LLMs, we highlight their limitations, particularly in terms of computational expense and inefficiency. We propose an LLM-based framework for data preprocessing, which integrates cutting-edge prompt engineering techniques, coupled with traditional methods like contextualization and feature selection, to improve the performance and efficiency of these models. The effectiveness of LLMs in data preprocessing is evaluated through an experimental study spanning 12 datasets. GPT-4 emerged as a standout, achieving 100\% accuracy or F1 score on 4 datasets, suggesting LLMs' immense potential in these tasks. Despite certain limitations, our study underscores the promise of LLMs in this domain and anticipates future developments to overcome current hurdles.

Firm competition and collusion involve complex dynamics, particularly when considering communication among firms. Such issues can be modeled as problems of complex systems, traditionally approached through experiments involving human subjects or agent-based modeling methods. We propose an innovative framework called Smart Agent-Based Modeling (SABM), wherein smart agents, supported by GPT-4 technologies, represent firms, and interact with one another. We conducted a controlled experiment to study firm price competition and collusion behaviors under various conditions. SABM is more cost-effective and flexible compared to conducting experiments with human subjects. Smart agents possess an extensive knowledge base for decision-making and exhibit human-like strategic abilities, surpassing traditional ABM agents. Furthermore, smart agents can simulate human conversation and be personalized, making them ideal for studying complex situations involving communication. Our results demonstrate that, in the absence of communication, smart agents consistently reach tacit collusion, leading to prices converging at levels higher than the Bertrand equilibrium price but lower than monopoly or cartel prices. When communication is allowed, smart agents achieve a higher-level collusion with prices close to cartel prices. Collusion forms more quickly with communication, while price convergence is smoother without it. These results indicate that communication enhances trust between firms, encouraging frequent small price deviations to explore opportunities for a higher-level win-win situation and reducing the likelihood of triggering a price war. We also assigned different personas to firms to analyze behavioral differences and tested variant models under diverse market structures. The findings showcase the effectiveness and robustness of SABM and provide intriguing insights into competition and collusion., Comment: Source code is available at: https://github.com/Roihn/SABM

In an edge-colored graph $G$, a rainbow clique $K_k$ is a $k$-complete subgraph in which all the edges have distinct colors. Let $e(G)$ and $c(G)$ be the number of edges and colors in $G$, respectively. In this paper, we show that for any $\varepsilon>0$, if $e(G)+c(G) \geq (1+\frac{k-3}{k-2}+2\varepsilon) {n\choose 2}$ and $k\geq 3$, then for sufficiently large $n$, the number of rainbow cliques $K_k$ in $G$ is $\Omega(n^k)$. We also characterize the extremal graphs $G$ without a rainbow clique $K_k$, for $k=4,5$, when $e(G)+c(G)$ is maximum. Our results not only address existing questions but also complete the findings of Ehard and Mohr (Ehard and Mohr, Rainbow triangles and cliques in edge-colored graphs. {\it European Journal of Combinatorics, 84:103037,2020})., Comment: 16pages

In recent years, machine learning-based cardinality estimation methods are replacing traditional methods. This change is expected to contribute to one of the most important applications of cardinality estimation, the query optimizer, to speed up query processing. However, none of the existing methods do not precisely estimate cardinalities when relational schemas consist of many tables with strong correlations between tables/attributes. This paper describes that multiple density estimators can be combined to effectively target the cardinality estimation of data with large and complex schemas having strong correlations. We propose Scardina, a new join cardinality estimation method using multiple partitioned models based on the schema structure.

Magnetic order in most materials occurs when magnetic ions with finite moments in a crystalline lattice arrange in a particular pattern below the ordering temperature determined by exchange interactions between the ions. However, when the crystal electric field (CEF) effect results in a spin-singlet ground state on individual magnetic sites, the collective ground state of the system can either remain non-magnetic, or more intriguingly, the exchange interactions between neighboring ions, provided they are sufficiently strong, can admix the excited CEF levels, resulting in a magnetically ordered ground state. The collective magnetic excitations in such a state are so-called spin excitons that describe the CEF transitions propagating through the lattice. In most cases, spin excitons originating from CEF levels of a localized single ion are dispersion-less in momentum (reciprocal) space and well-defined in both the magnetically ordered and paramagnetic states. Here we use thermodynamic and neutron scattering experiments to study stoichiometric Ni2Mo3O8 without site disorder, where Ni2+ ions form a bipartite honeycomb lattice comprised of two triangular lattices, with ions subject to the tetrahedral and octahedral crystalline environment, respectively. We find that in both types of ions, the CEF excitations have nonmagnetic singlet ground states, yet the material has long-range magnetic order. Furthermore, CEF spin excitons from the triangular-lattice arrangement of tetrahedral sites form, in both the antiferromagnetic and paramagnetic states, a dispersive diffusive pattern around the Brillouin zone boundary in reciprocal space. The present work thus demonstrates that spin excitons in an ideal triangular lattice magnet can have dispersive excitations, irrespective of the existence of static magnetic order, and this phenomenon is most likely due to spin entanglement and geometric frustrations.

Due to the usefulness in data enrichment for data analysis tasks, joinable table discovery has become an important operation in data lake management. Existing approaches target equi-joins, the most common way of combining tables for creating a unified view, or semantic joins, which tolerate misspellings and different formats to deliver more join results. They are either exact solutions whose running time is linear in the sizes of query column and target table repository or approximate solutions lacking precision. In this paper, we propose Deepjoin, a deep learning model for accurate and efficient joinable table discovery. Our solution is an embedding-based retrieval, which employs a pre-trained language model (PLM) and is designed as one framework serving both equi- and semantic joins. We propose a set of contextualization options to transform column contents to a text sequence. The PLM reads the sequence and is fine-tuned to embed columns to vectors such that columns are expected to be joinable if they are close to each other in the vector space. Since the output of the PLM is fixed in length, the subsequent search procedure becomes independent of the column size. With a state-of-the-art approximate nearest neighbor search algorithm, the search time is logarithmic in the repository size. To train the model, we devise the techniques for preparing training data as well as data augmentation. The experiments on real datasets demonstrate that by training on a small subset of a corpus, Deepjoin generalizes to large datasets and its precision consistently outperforms other approximate solutions'. Deepjoin is even more accurate than an exact solution to semantic joins when evaluated with labels from experts. Moreover, when equipped with a GPU, Deepjoin is up to two orders of magnitude faster than existing solutions.

Retroactive operation is an operation that changes a past operation in a series of committed ones (e.g., cancelling the past insertion of '5' into a queue committed at t=3). Retroactive operation has many important security applications such as attack recovery or private data removal (e.g., for GDPR compliance). While prior efforts designed retroactive algorithms for low-level data structures (e.g., queue, set), none explored retroactive operation for higher levels, such as database systems or web applications. This is challenging, because: (i) SQL semantics of database systems is complex; (ii) data records can flow through various web application components, such as HTML's DOM trees, server-side user request handlers, and client-side JavaScript code. We propose Ultraverse, the first retroactive operation framework comprised of two components: a database system and a web application framework. The former enables users to retroactively change committed SQL queries; the latter does the same for web applications with preserving correctness of application semantics. Our experimental results show that Ultraverse achieves 10.5x~693.3x speedup on retroactive database update compared to a regular DBMS's flashback and redo.

The deconfined quantum critical point (DQCP) between the N\'{e}el and valence bond solid (VBS) order was originally proposed in quantum spin systems with a local Hamiltonian. In the last few years analogues of DQCPs with nonlocal interactions have been explored, which can lead to rich possibilities. The nonlocal interactions can either arise from an instantaneous long range interaction in the Hamiltonian, or from gapless modes that reside in one higher spatial dimension. Here we consider another mechanism of generating nonlocal interactions by coupling the DQCP to the "hot spots" of a Fermi surface. We demonstrate that at least within a substantial energy window, the physics of the DQCP is controlled by a new fixed point with dynamical exponent $z > 1$

Federated learning is a distributed machine learning approach in which a single server and multiple clients collaboratively build machine learning models without sharing datasets on clients. A challenging issue of federated learning is data heterogeneity (i.e., data distributions may differ across clients). To cope with this issue, numerous federated learning methods aim at personalized federated learning and build optimized models for clients. Whereas existing studies empirically evaluated their own methods, the experimental settings (e.g., comparison methods, datasets, and client setting) in these studies differ from each other, and it is unclear which personalized federate learning method achieves the best performance and how much progress can be made by using these methods instead of standard (i.e., non-personalized) federated learning. In this paper, we benchmark the performance of existing personalized federated learning through comprehensive experiments to evaluate the characteristics of each method. Our experimental study shows that (1) there are no champion methods, (2) large data heterogeneity often leads to high accurate predictions, and (3) standard federated learning methods (e.g. FedAvg) with fine-tuning often outperform personalized federated learning methods. We open our benchmark tool FedBench for researchers to conduct experimental studies with various experimental settings.