default search action
Taisuke Yasuda 0002
Person information
- affiliation: Carnegie Mellon University, USA
Other persons with the same name
- Taisuke Yasuda 0001 — Mount Fuji Research Institute, Yamanashi Prefectural Government, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c14]David P. Woodruff, Taisuke Yasuda:
Reweighted Solutions for Weighted Low Rank Approximation. ICML 2024 - [c13]David P. Woodruff, Taisuke Yasuda:
Coresets for Multiple ℓp Regression. ICML 2024 - [i17]Taisuke Yasuda, Kyriakos Axiotis, Gang Fu, MohammadHossein Bateni, Vahab Mirrokni:
SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization. CoRR abs/2402.17902 (2024) - [i16]David P. Woodruff, Taisuke Yasuda:
Reweighted Solutions for Weighted Low Rank Approximation. CoRR abs/2406.02431 (2024) - [i15]David P. Woodruff, Taisuke Yasuda:
Coresets for Multiple ℓp Regression. CoRR abs/2406.02432 (2024) - [i14]David P. Woodruff, Taisuke Yasuda:
Nearly Linear Sparsification of ℓp Subspace Approximation. CoRR abs/2407.03262 (2024) - 2023
- [c12]Taisuke Yasuda, Mohammad Hossein Bateni, Lin Chen, Matthew Fahrbach, Gang Fu, Vahab Mirrokni:
Sequential Attention for Feature Selection. ICLR 2023 - [c11]David P. Woodruff, Taisuke Yasuda:
Sharper Bounds for ℓp Sensitivity Sampling. ICML 2023: 37238-37272 - [c10]Gregory Dexter, Petros Drineas, David P. Woodruff, Taisuke Yasuda:
Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming. NeurIPS 2023 - [c9]David P. Woodruff, Taisuke Yasuda
:
Online Lewis Weight Sampling. SODA 2023: 4622-4666 - [c8]David P. Woodruff, Taisuke Yasuda:
New Subset Selection Algorithms for Low Rank Approximation: Offline and Online. STOC 2023: 1802-1813 - [i13]David P. Woodruff, Taisuke Yasuda:
New Subset Selection Algorithms for Low Rank Approximation: Offline and Online. CoRR abs/2304.09217 (2023) - [i12]David P. Woodruff, Taisuke Yasuda:
Sharper Bounds for 𝓁p Sensitivity Sampling. CoRR abs/2306.00732 (2023) - [i11]Kyriakos Axiotis, Taisuke Yasuda:
Performance of 𝓁1 Regularization for Sparse Convex Optimization. CoRR abs/2307.07405 (2023) - [i10]Gregory Dexter, Petros Drineas, David P. Woodruff, Taisuke Yasuda:
Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming. CoRR abs/2310.19068 (2023) - 2022
- [c7]David P. Woodruff, Taisuke Yasuda
High-Dimensional Geometric Streaming in Polynomial Space. FOCS 2022: 732-743 - [c6]Cameron Musco, Christopher Musco, David P. Woodruff, Taisuke Yasuda
Active Linear Regression for ℓp Norms and Beyond. FOCS 2022: 744-753 - [c5]David P. Woodruff, Taisuke Yasuda
Improved Algorithms for Low Rank Approximation from Sparsity. SODA 2022: 2358-2403 - [i9]David P. Woodruff, Taisuke Yasuda:
High-Dimensional Geometric Streaming in Polynomial Space. CoRR abs/2204.03790 (2022) - [i8]David P. Woodruff, Taisuke Yasuda:
Online Lewis Weight Sampling. CoRR abs/2207.08268 (2022) - [i7]MohammadHossein Bateni, Lin Chen, Matthew Fahrbach, Gang Fu, Vahab Mirrokni, Taisuke Yasuda:
Sequential Attention for Feature Selection. CoRR abs/2209.14881 (2022) - 2021
- [c4]Yi Li, David P. Woodruff, Taisuke Yasuda:
Exponentially Improved Dimensionality Reduction for l1: Subspace Embeddings and Independence Testing. COLT 2021: 3111-3195 - [i6]Yi Li, David P. Woodruff, Taisuke Yasuda:
Exponentially Improved Dimensionality Reduction for 𝓁1: Subspace Embeddings and Independence Testing. CoRR abs/2104.12946 (2021) - [i5]David P. Woodruff, Taisuke Yasuda:
Improved Algorithms for Low Rank Approximation from Sparsity. CoRR abs/2111.00668 (2021) - [i4]Cameron Musco, Christopher Musco, David P. Woodruff, Taisuke Yasuda:
Active Sampling for Linear Regression Beyond the $\ell_2$ Norm. CoRR abs/2111.04888 (2021) - 2020
- [c3]Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
Graph Spanners in the Message-Passing Model. ITCS 2020: 77:1-77:18
2010 – 2019
- 2019
- [c2]Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
The Query Complexity of Mastermind with lp Distances. APPROX-RANDOM 2019: 1:1-1:11 - [c1]Taisuke Yasuda, David P. Woodruff, Manuel Fernandez:
Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering. ICML 2019: 7055-7063 - [i3]Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel k-means Clustering. CoRR abs/1905.06394 (2019) - [i2]Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
The Query Complexity of Mastermind with 𝓁p Distances. CoRR abs/1909.10668 (2019) - [i1]Manuel Fernandez, David P. Woodruff, Taisuke Yasuda:
Graph Spanners in the Message-Passing Model. CoRR abs/1911.05991 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 00:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: