中文
相关论文

相关论文: SQUAD: Combining Sketching and Sampling Is Better …

200 篇论文

Sketching is a probabilistic data compression technique that has been largely developed in the computer science community. Numerical operations on big datasets can be intolerably slow; sketching algorithms address this issue by generating a…

统计方法学 · 统计学 2019-04-04 Daniel Ahfock , William J. Astle , Sylvia Richardson

The compressive learning framework reduces the computational cost of training on large-scale datasets. In a sketching phase, the data is first compressed to a lightweight sketch vector, obtained by mapping the data samples through a…

机器学习 · 统计学 2022-04-20 Vincent Schellekens , Laurent Jacques

Leveraging the kernel trick in both the input and output spaces, surrogate kernel methods are a flexible and theoretically grounded solution to structured output prediction. If they provide state-of-the-art performance on complex data sets…

机器学习 · 统计学 2024-05-07 Tamim El Ahmad , Luc Brogat-Motte , Pierre Laforgue , Florence d'Alché-Buc

We present SKALD, a multi-shot video assembly method that constructs coherent video sequences from candidate shots with minimal reliance on text. Central to our approach is the Learned Clip Assembly (LCA) score, a learning-based metric that…

计算机视觉与模式识别 · 计算机科学 2025-08-19 Chen Yi Lu , Md Mehrab Tanjim , Ishita Dasgupta , Somdeb Sarkhel , Gang Wu , Saayan Mitra , Somali Chaterji

Sketching and streaming algorithms are in the forefront of current research directions for cut problems in graphs. In the streaming model, we show that $(1-\epsilon)$-approximation for Max-Cut must use $n^{1-O(\epsilon)}$ space; moreover,…

数据结构与算法 · 计算机科学 2026-02-23 Dmitry Kogan , Robert Krauthgamer

Sketch-and-project is a framework which unifies many known iterative methods for solving linear systems and their variants, as well as further extensions to non-linear optimization problems. It includes popular methods such as randomized…

最优化与控制 · 数学 2023-09-20 Michał Dereziński , Elizaveta Rebrova

We consider statistical as well as algorithmic aspects of solving large-scale least-squares (LS) problems using randomized sketching algorithms. For a LS problem with input data $(X, Y) \in \mathbb{R}^{n \times p} \times \mathbb{R}^n$,…

机器学习 · 统计学 2015-08-26 Garvesh Raskutti , Michael Mahoney

Streaming video understanding requires models to robustly encode, store, and retrieve information from a continuous video stream to support accurate video question answering (VQA). Existing state-of-the-art approaches rely on key-value…

计算机视觉与模式识别 · 计算机科学 2026-02-23 Vatsal Agarwal , Saksham Suri , Matthew Gwilliam , Pulkit Kumar , Abhinav Shrivastava

Frequency estimation in streaming data often relies on sketches like Count-Min (CM) to provide approximate answers with sublinear space. However, CM sketches introduce additive errors that disproportionately impact low-frequency elements,…

数据结构与算法 · 计算机科学 2025-05-27 Nima Shahbazi , Stavros Sintos , Abolfazl Asudeh

Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to track users with the largest deviation from the norm (outliers),…

数据库 · 计算机科学 2009-07-20 Chiranjeeb Buragohain , Luca Foschini , Subhash Suri

In this work, we investigate the problem of sketch-based object localization on natural images, where given a crude hand-drawn sketch of an object, the goal is to localize all the instances of the same object on the target image. This…

计算机视觉与模式识别 · 计算机科学 2023-03-16 Aditay Tripathi , Anand Mishra , Anirban Chakraborty

Today's large-scale services (e.g., video streaming platforms, data centers, sensor grids) need diverse real-time summary statistics across multiple subpopulations of multidimensional datasets. However, state-of-the-art frameworks do not…

数据库 · 计算机科学 2022-08-10 Antonis Manousis , Zhuo Cheng , Ran Ben Basat , Zaoxing Liu , Vyas Sekar

We present a novel approach for the problem of frequency estimation in data streams that is based on optimization and machine learning. Contrary to state-of-the-art streaming frequency estimation algorithms, which heavily rely on random…

数据结构与算法 · 计算机科学 2022-07-19 Dimitris Bertsimas , Vassilis Digalakis

Distributed deep learning (DDL) training systems are designed for cloud and data-center environments that assumes homogeneous compute resources, high network bandwidth, sufficient memory and storage, as well as independent and identically…

分布式、并行与集群计算 · 计算机科学 2024-01-30 Sahil Tyagi , Martin Swany

The practicality of a video surveillance system is adversely limited by the amount of queries that can be placed on human resources and their vigilance in response. To transcend this limitation, a major effort under way is to include…

计算机视觉与模式识别 · 计算机科学 2014-05-16 Samaneh Khoshrou , Jaime S. Cardoso , Luis F. Teixeira

Sketching algorithms or sketches have emerged as a promising alternative to the traditional packet sampling-based network telemetry solutions. At a high level, they are attractive because of their high resource efficiency and accuracy…

网络与互联网体系结构 · 计算机科学 2020-12-14 Zaoxing Liu , Hun Namkung , Anup Agarwal , Antonis Manousis , Peter Steenkiste , Srinivasan Seshan , Vyas Sekar

We address the problem of estimating the running quantile of a data stream when the memory for storing observations is limited. We (i) highlight the limitations of approaches previously described in the literature which make them unsuitable…

数据结构与算法 · 计算机科学 2014-09-26 Ognjen Arandjelovic , Ducson Pham , Svetha Venkatesh

In recent years, with the rapid development of sensing technology and the Internet of Things (IoT), sensors play increasingly important roles in traffic control, medical monitoring, industrial production and etc. They generated high volume…

分布式、并行与集群计算 · 计算机科学 2020-06-11 Hang Zhao , Jie Tang

Sketch-based monitoring in SDN often suffers from tightly coupled pipeline and memory constraints, limiting algorithmic flexibility and reducing accuracy. We propose PSketch, the first in-kernel priority-aware sketching framework…

新兴技术 · 计算机科学 2025-09-10 Yuanjun Dai , Qingzhe Guo , Xiangren Wang

In sketched clustering, a dataset of $T$ samples is first sketched down to a vector of modest size, from which the centroids are subsequently extracted. Advantages include i) reduced storage complexity and ii) centroid extraction complexity…

信息论 · 计算机科学 2019-05-21 Evan Byrne , Antoine Chatalic , Remi Gribonval , Philip Schniter