Electronic Colloquium on Computational Complexity, Report No. 70 (2007) Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes

No abstract is available for this paper.

• Publication year

  year unknown

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• No references are available for this paper.

• Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Low-Rank Matrices? Yes, MAM*!

  2025influential citation
• A Practical Randomized GMRES Algorithm for Solving Linear Equation System in Circuit Simulation

  2025cites this paper
• Fast Dimensionality Reduction from ℓ2 to ℓp

  2025influential citation
• A High Performance GPU CountSketch Implementation and Its Application to Multisketching and Least Squares Problems

  2025cites this paper
• Randomized Krylov methods for inverse problems

  2025cites this paper
• Randomized Orthogonalization Process With Reorthogonalization

  2025cites this paper
• On Extended Concentration Inequalities for Fast JL Embeddings of Infinite Sets

  2025cites this paper
• Detecting Interactions in High‐Dimensional Data Using Cross Leverage Scores

  2024cites this paper
• Fast Multidimensional Partial Fourier Transform with Automatic Hyperparameter Selection

  2024cites this paper
• Fast Locality Sensitive Hashing with Theoretical Guarantee

  2023cites this paper
• A Sparse Johnson-Lindenstrauss Transform using Fast Hashing

  2023cites this paper
• Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees

  2023cites this paper
• On the Noise Sensitivity of the Randomized SVD

  2023cites this paper
• Barriers for Faster Dimensionality Reduction

  2022cites this paper
• pylspack: Parallel Algorithms and Data Structures for Sketching, Column Subset Selection, Regression, and Leverage Scores

  2022cites this paper
• Differentially Private Learning with Margin Guarantees

  2022cites this paper
• Approximate Euclidean lengths and distances beyond Johnson-Lindenstrauss

  2022cites this paper
• Iterative Double Sketching for Faster Least-Squares Optimization

  2022influential citation
• The Fast Johnson-Lindenstrauss Transform is Even Faster

  2022cites this paper
• Fast metric embedding into the Hamming cube

  2022cites this paper
• Modular Paulsen Problem and Modular Projection Problem

  2022cites this paper
• On using affine sketches for multiple-response dynamic graph regression

  2022cites this paper
• Modular Bourgain-Tzafriri Restricted Invertibility Conjectures and Johnson-Lindenstrauss Flattening Conjecture

  2022cites this paper
• On a Connection Between Fast and Sparse Oblivious Subspace Embeddings

  2022influential citation
• Sparse Neural Networks: Theory and practice

  2021cites this paper
• Fast and Accurate Partial Fourier Transform for Time Series Data

  2021influential citation
• RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression

  2021cites this paper
• Single-pixel compressive imaging based on random DoG filtering

  2021cites this paper
• An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iteration

  2021cites this paper
• A Selective Review on Statistical Techniques for Big Data

  2021cites this paper
• Estimating leverage scores via rank revealing methods and randomization

  2021influential citation
• Degraded Visual Environment Tracker

  2021cites this paper
• Randomized block Gram-Schmidt process for solution of linear systems and eigenvalue problems

  2021cites this paper
• Fast Binary Embedding of Deep Learning Image Features Using Golay-Hadamard Matrices

  2021cites this paper
• Few-Shot Data-Driven Algorithms for Low Rank Approximation

  2021cites this paper
• Integrated Random Projection and Dimensionality Reduction by Propagating Light in Photonic Lattices

  2021cites this paper
• An Introduction to Johnson-Lindenstrauss Transforms

  2021cites this paper
• Accumulation of Sub-Sampling Matrices with Applications to Statistical Computation

  2021cites this paper
• Cross Tensor Approximation Methods for Compression and Dimensionality Reduction

  2021cites this paper
• Sketch Kernel Ridge Regression Using Circulant Matrix: Algorithm and Theory

  2020cites this paper
• Randomized algorithms for fast computation of low rank tensor ring model

  2020cites this paper
• Randomized Gram-Schmidt process with application to GMRES

  2020influential citation
• Similarity Search and Applications: 13th International Conference, SISAP 2020, Copenhagen, Denmark, September 30 – October 2, 2020, Proceedings

  2020cites this paper
• Similarity Search with Tensor Core Units

  2020cites this paper
• Sparse Linear Networks with a Fixed Butterfly Structure: Theory and Practice

  2020cites this paper
• Deterministic Compressed Domain Analysis of Multi-channel ECG Measurements

  2020cites this paper
• Making Online Sketching Hashing Even Faster

  2020cites this paper
• Fast and memory-optimal dimension reduction using Kac’s walk

  2020influential citation
• Improved Subsampled Randomized Hadamard Transform for Linear SVM

  2020cites this paper
• Investigation of Kronecker-Based Recovery of Compressed ECG Signal

  2020cites this paper
• Randomized Algorithms for Computation of Tucker Decomposition and Higher Order SVD (HOSVD)

  2020cites this paper
• Dynamical algorithms for data mining and machine learning over dynamic graphs

  2020cites this paper
• Ensemble learning of high dimension datasets

  2020cites this paper
• CS265/CME309: Randomized Algorithms and Probabilistic Analysis Lecture #8: Dimension Reduction and Nearest Neighbor Search

  2019cites this paper
• Faster Least Squares Optimization

  2019cites this paper
• Randomized structure-adaptive optimization

  2019influential citation
• Nuclear magnetic resonance T1-T2 inversion with double objective functions.

  2019cites this paper
• Investigation of Kronecker-based Recovery in Compressive Sensing

  2019cites this paper
• Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma

  2019cites this paper
• Randomized linear algebra for model order reduction

  2019influential citation
• Nuclear Magnetic Resonance T1–T2 Spectra in Heavy Oil Reservoirs

  2019cites this paper
• An Efficient Method for NMR Data Compression Based on Fast Singular Value Decomposition

  2019cites this paper
• A Framework for Bayesian Optimization in Embedded Subspaces

  2019cites this paper
• Sublinear update time randomized algorithms for dynamic graph regression

  2019cites this paper
• Numerical decoding , Johnson-Lindenstrauss transforms , and linear codes

  2018cites this paper
• Training neural networks on high-dimensional data using random projection

  2018cites this paper
• Error Estimation for Randomized Least-Squares Algorithms via the Bootstrap

  2018cites this paper
• Sketched Follow-The-Regularized-Leader for Online Factorization Machine

  2018cites this paper
• Simple Analyses of the Sparse Johnson-Lindenstrauss Transform

  2018cites this paper
• Improvement of Recovery in Segmentation-Based Parallel Compressive Sensing

  2018cites this paper
• Improvement of Recovery in Segmentation-Based Parallel Compressive Sensing

  2018cites this paper
• Randomized linear algebra for model reduction. Part I: Galerkin methods and error estimation

  2018cites this paper
• Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering

  2018influential citation
• Random Projection in Deep Neural Networks

  2018cites this paper
• Fast, Deterministic and Sparse Dimensionality Reduction

  2018cites this paper
• Compressed Dictionary Learning

  2018cites this paper
• Data gathering in wireless sensor networks via regular low density parity check matrix

  2018cites this paper
• Improved Random Projection with $K$-Means Clustering for Hyperspectral Image Classification

  2018cites this paper
• N ov 2 01 8 Relative Error RKHS Embeddings for Gaussian Kernels

  2018cites this paper
• Randomized non negative matrix factorization for hyperspectral image classification

  2018cites this paper
• Relative Error RKHS Embeddings for Gaussian Kernels

  2018cites this paper
• A stability result using the matrix norm to bound the permanent

  2018cites this paper
• Robust Frequent Directions with Application in Online Learning

  2017cites this paper
• Coresets-Methods and History: A Theoreticians Design Pattern for Approximation and Streaming Algorithms

  2017cites this paper
• A Bootstrap Method for Error Estimation in Randomized Matrix Multiplication

  2017cites this paper
• Random projections for high-dimensional optimization problems

  2017cites this paper
• Optimal fast Johnson–Lindenstrauss embeddings for large data sets

  2017cites this paper
• On Using Toeplitz and Circulant Matrices for Johnson–Lindenstrauss Transforms

  2017cites this paper
• FROSH: FasteR Online Sketching Hashing

  2017cites this paper
• Compressive Traffic Analysis: A New Paradigm for Scalable Traffic Analysis

  2017cites this paper
• Lectures on Randomized Numerical Linear Algebra

  2017cites this paper
• Johnson-Lindenstrauss Transformations

  2017cites this paper
• Improved bounds for sparse recovery from subsampled random convolutions

  2016cites this paper
• An Optimization Approach to Locally-Biased Graph Algorithms

  2016cites this paper
• Random projection for high-dimensional optimization

  2016cites this paper
• Reliable and Efficient Algorithms for Spectrum-Revealing Low-Rank Data Analysis

  2016cites this paper
• Faster Kernel Ridge Regression Using Sketching and Preconditioning

  2016cites this paper
• Hadamard-Walsh random projection for hyperspectral image classification

  2016cites this paper
• Fast Randomized Algorithms for Convex Optimization and Statistical Estimation

  2016cites this paper
• Random-projection-based nonnegative least squares for hyperspectral image unmixing

  2016cites this paper