Search

Let $X$ be a ball quasi-Banach function space on $\mathbb R^{n}$ and $h_{X}(\mathbb R^{n})$ the local Hardy space associated with $X$. In this paper, under some reasonable assumptions on $X$, the infinite and finite atomic decompositions for the local Hardy space $h_{X}(\mathbb R^{n})$ are established directly, without relying on the relation between $H_{X}(\mathbb R^{n})$ and $h_{X}(\mathbb R^{n})$. Moreover, we apply the finite atomic decomposition to obtain the dual space of the local Hardy space $h_{X}(\mathbb R^{n})$. Especially, the above results can be applied to several specific ball quasi-Banach function spaces, demonstrating their wide range of applications., Comment: 28 pages. arXiv admin note: text overlap with arXiv:2208.06266, arXiv:2206.06551 by other authors

Let $X\left(\mathbb{R}^{n}\right)$ be a ball quasi-Banach function space on $\mathbb{R}^{n}$, $WX\left(\mathbb{R}^{n}\right)$ be the weak ball quasi-Banach function space on $\mathbb{R}^{n}$, $H_{X}\left(\mathbb{R}^{n}\right)$ be the Hardy space associated with $X\left(\mathbb{R}^{n}\right)$ and $WH_{X}\left(\mathbb{R}^{n}\right)$ be the weak Hardy space associated with $X\left(\mathbb{R}^{n}\right)$. In this paper, we obtain the boundedness of the Bochner--Riesz means and the maximal Bochner--Riesz means from $H_{X}\left(\mathbb{R}^{n}\right)$ to $WH_{X}\left(\mathbb{R}^{n}\right)$ or $WX\left(\mathbb{R}^{n}\right)$, which includes the critical case. Moreover, we apply these results to several examples of ball quasi-Banach function spaces, namely, weighted Lebesgue spaces, Herz spaces, Lorentz spaces, variable Lebesgue spaces and Morrey spaces. This shows that all the results obtained in this article are of wide applications, and more applications of these results are predictable., Comment: 30 pages. arXiv admin note: text overlap with arXiv:1905.02097 by other authors

The purpose of this paper is to obtain atomic decomposition characterization of the weighted local Hardy space $h_{\omega}^{p}(\mathbb {R}^{n})$ with $\omega\in A_{\infty}(\mathbb {R}^{n})$. We apply the discrete version of Calder\'on's identity and the weighted Littlewood--Paley--Stein theory to prove that $h_{\omega}^{p}(\mathbb {R}^{n})$ coincides with the weighted$\text{-}(p,q,s)$ atomic local Hardy space $h_{\omega,atom}^{p,q,s}(\mathbb {R}^{n})$ for $0

The main purpose of this paper is to develop the theory of product Hardy spaces built on Banach lattices on $\mathbb R^n\times\mathbb R^m$. First we introduce new product Hardy spaces ${H}_X(\mathbb R^n\times\mathbb R^m)$ associated with ball quasi-Banach function spaces $X(\mathbb R^n\times\mathbb R^m)$ via applying the Littlewood-Paley-Stein theory. Then we establish a decomposition theorem for ${H}_X(\mathbb R^n\times\mathbb R^m)$ in terms of the discrete Calder\'on's identity. Moreover, we explore some useful and general extrapolation theorems of Rubio de Francia on $X(\mathbb R^n\times\mathbb R^m)$ and give some applications to boundedness of operators. Finally, we conclude that the two-parameter singular integral operators $\widetilde T$ are bounded from ${H}_X(\mathbb R^n\times\mathbb R^m)$ to itself and bounded from ${H}_X(\mathbb R^n\times\mathbb R^m)$ to $X(\mathbb R^n\times\mathbb R^m)$ via extrapolation. The main results obtained in this paper have a wide range of generality. Especially, we can apply these results to many concrete examples of ball quasi-Banach function spaces, including product Herz spaces, weighted product Morrey spaces and product Musielak--Orlicz--type spaces., Comment: 27 pages

Seasonal-trend decomposition is one of the most fundamental concepts in time series analysis that supports various downstream tasks, including time series anomaly detection and forecasting. However, existing decomposition methods rely on batch processing with a time complexity of O(W), where W is the number of data points within a time window. Therefore, they cannot always efficiently support real-time analysis that demands low processing delay. To address this challenge, we propose OneShotSTL, an efficient and accurate algorithm that can decompose time series online with an update time complexity of O(1). OneShotSTL is more than $1,000$ times faster than the batch methods, with accuracy comparable to the best counterparts. Extensive experiments on real-world benchmark datasets for downstream time series anomaly detection and forecasting tasks demonstrate that OneShotSTL is from 10 to over 1,000 times faster than the state-of-the-art methods, while still providing comparable or even better accuracy., Comment: PVLDB 2023

Recently using machine learning (ML) based techniques to optimize modern database management systems has attracted intensive interest from both industry and academia. With an objective to tune a specific component of a DBMS (e.g., index selection, knobs tuning), the ML-based tuning agents have shown to be able to find better configurations than experienced database administrators. However, one critical yet challenging question remains unexplored -- how to make those ML-based tuning agents work collaboratively. Existing methods do not consider the dependencies among the multiple agents, and the model used by each agent only studies the effect of changing the configurations in a single component. To tune different components for DBMS, a coordinating mechanism is needed to make the multiple agents cognizant of each other. Also, we need to decide how to allocate the limited tuning budget among the agents to maximize the performance. Such a decision is difficult to make since the distribution of the reward for each agent is unknown and non-stationary. In this paper, we study the above question and present a unified coordinating framework to efficiently utilize existing ML-based agents. First, we propose a message propagation protocol that specifies the collaboration behaviors for agents and encapsulates the global tuning messages in each agent's model. Second, we combine Thompson Sampling, a well-studied reinforcement learning algorithm with a memory buffer so that our framework can allocate budget judiciously in a non-stationary environment. Our framework defines the interfaces adapted to a broad class of ML-based tuning agents, yet simple enough for integration with existing implementations and future extensions. We show that it can effectively utilize different ML-based agents and find better configurations with 1.4~14.1X speedups on the workload execution time compared with baselines., Comment: Accepted at 2023 International Conference on Management of Data (SIGMOD '23)

Template mining is one of the foundational tasks to support log analysis, which supports the diagnosis and troubleshooting of large scale Web applications. This paper develops a human-in-the-loop template mining framework to support interactive log analysis, which is highly desirable in real-world diagnosis or troubleshooting of Web applications but yet previous template mining algorithms fails to support it. We formulate three types of light-weight user feedbacks and based on them we design three atomic human-in-the-loop template mining algorithms. We derive mild conditions under which the outputs of our proposed algorithms are provably correct. We also derive upper bounds on the computational complexity and query complexity of each algorithm. We demonstrate the versatility of our proposed algorithms by combining them to improve the template mining accuracy of five representative algorithms over sixteen widely used benchmark datasets.

This paper proposes LPC-AD, a fast and accurate multivariate time series (MTS) anomaly detection method. LPC-AD is motivated by the ever-increasing needs for fast and accurate MTS anomaly detection methods to support fast troubleshooting in cloud computing, micro-service systems, etc. LPC-AD is fast in the sense that its reduces the training time by as high as 38.2% compared to the state-of-the-art (SOTA) deep learning methods that focus on training speed. LPC-AD is accurate in the sense that it improves the detection accuracy by as high as 18.9% compared to SOTA sophisticated deep learning methods that focus on enhancing detection accuracy. Methodologically, LPC-AD contributes a generic architecture LPC-Reconstruct for one to attain different trade-offs between training speed and detection accuracy. More specifically, LPC-Reconstruct is built on ideas from autoencoder for reducing redundancy in time series, latent predictive coding for capturing temporal dependence in MTS, and randomized perturbation for avoiding overfitting of anomalous dependence in the training data. We present simple instantiations of LPC-Reconstruct to attain fast training speed, where we propose a simple randomized perturbation method. The superior performance of LPC-AD over SOTA methods is validated by extensive experiments on four large real-world datasets. Experiment results also show the necessity and benefit of each component of the LPC-Reconstruct architecture and that LPC-AD is robust to hyper parameters.

Configuration knobs of database systems are essential to achieve high throughput and low latency. Recently, automatic tuning systems using machine learning methods (ML) have shown to find better configurations compared to experienced database administrators (DBAs). However, there are still gaps to apply the existing systems in production environments, especially in the cloud. First, they conduct tuning for a given workload within a limited time window and ignore the dynamicity of workloads and data. Second, they rely on a copied instance and do not consider the availability of the database when sampling configurations, making the tuning expensive, delayed, and unsafe. To fill these gaps, we propose OnlineTune, which tunes the online databases safely in changing cloud environments. To accommodate the dynamicity, OnlineTune embeds the environmental factors as context feature and adopts contextual Bayesian Optimization with context space partition to optimize the database adaptively and scalably. To pursue safety during tuning, we leverage the black-box and the white-box knowledge to evaluate the safety of configurations and propose a safe exploration strategy via subspace adaptation.%, greatly decreasing the risks of applying bad configurations. We conduct evaluations on dynamic workloads from benchmarks and real-world workloads. Compared with the state-of-the-art methods, OnlineTune achieves 14.4%~165.3% improvement on cumulative performance while reducing 91.0%~99.5% unsafe configuration recommendations.

Recently, using automatic configuration tuning to improve the performance of modern database management systems (DBMSs) has attracted increasing interest from the database community. This is embodied with a number of systems featuring advanced tuning capabilities being developed. However, it remains a challenge to select the best solution for database configuration tuning, considering the large body of algorithm choices. In addition, beyond the applications on database systems, we could find more potential algorithms designed for configuration tuning. To this end, this paper provides a comprehensive evaluation of configuration tuning techniques from a broader perspective, hoping to better benefit the database community. In particular, we summarize three key modules of database configuration tuning systems and conduct extensive ablation studies using various challenging cases. Our evaluation demonstrates that the hyper-parameter optimization algorithms can be borrowed to further enhance the database configuration tuning. Moreover, we identify the best algorithm choices for different modules. Beyond the comprehensive evaluations, we offer an efficient and unified database configuration tuning benchmark via surrogates that reduces the evaluation cost to a minimum, allowing for extensive runs and analysis of new techniques.

In this paper, we give a complete real-variable theory of local variable Hardy spaces. First, we present various real-variable characterizations in terms of several local maximal functions. Next, the new atomic and the finite atomic decomposition for the local variable Hardy spaces are established. As an application, we also introduce the local variable Campanato space which is showed to be the dual space of the local variable Hardy spaces. Analogous to the homogeneous case, some equivalent definitions of the dual of local variable Hardy spaces are also considered. Finally, we show that the boundedness of inhomogeneous Calder\'on-Zygmund singular integrals and local fractional integrals on local variable Hardy spaces and their duals., Comment: 40 pages