Reinforced Approximate Exploratory Data Analysis

Authors

  • Shaddy Garg Adobe Research
  • Subrata Mitra Adobe Research
  • Tong Yu Adobe Research
  • Yash Gadhia IIT Bombay
  • Arjun Kashettiwar IIT Bombay

DOI:

https://doi.org/10.1609/aaai.v37i6.25929

Keywords:

ML: Applications, ML: Reinforcement Learning Algorithms, RU: Sequential Decision Making

Abstract

Exploratory data analytics (EDA) is a sequential decision making process where analysts choose subsequent queries that might lead to some interesting insights based on the previous queries and corresponding results. Data processing systems often execute the queries on samples to produce results with low latency. Different downsampling strategy preserves different statistics of the data and have different magnitude of latency reductions. The optimum choice of sampling strategy often depends on the particular context of the analysis flow and the hidden intent of the analyst. In this paper, we are the first to consider the impact of sampling in interactive data exploration settings as they introduce approximation errors. We propose a Deep Reinforcement Learning (DRL) based framework which can optimize the sample selection in order to keep the analysis and insight generation flow intact. Evaluations with real datasets show that our technique can preserve the original insight generation flow while improving the interaction latency, compared to baseline methods.

Downloads

Published

2023-06-26

How to Cite

Garg, S., Mitra, S., Yu, T., Gadhia, Y., & Kashettiwar, A. (2023). Reinforced Approximate Exploratory Data Analysis. Proceedings of the AAAI Conference on Artificial Intelligence, 37(6), 7660-7669. https://doi.org/10.1609/aaai.v37i6.25929

Issue

Section

AAAI Technical Track on Machine Learning I