Search Results for author:
Found 14 papers, 10 papers with code
Koopman Neural Forecaster for Time Series with Temporal Distribution Shifts
Temporal distributional shifts, with underlying dynamics changing over time, frequently occur in real-world time series and pose a fundamental challenge for deep neural networks (DNNs).
COSTAR: Improved Temporal Counterfactual Estimation with Self-Supervised Learning
Estimation of temporal counterfactual outcomes from observed history is crucial for decision-making in many domains such as healthcare and e-commerce, particularly when randomized controlled trials (RCTs) suffer from high cost or impracticality.
Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depth
Attention-based architectures have become ubiquitous in machine learning, yet our understanding of the reasons for their effectiveness remains limited.
Scalable Nearest Neighbor Search for Optimal Transport
Our extensive experiments, on real-world text and image datasets, show that Flowtree improves over various baselines and existing methods in either running time or accuracy.
Data Structures and Algorithms
Learning Space Partitions for Nearest Neighbor Search
Space partitions of $\mathbb{R}^d$ underlie a vast and important class of fast nearest neighbor search (NNS) algorithms.
HNHN: Hypergraph Networks with Hyperedge Neurons
Hypergraphs provide a natural representation for many real world datasets.
CoinPress: Practical Private Mean and Covariance Estimation
We present simple differentially private estimators for the mean and covariance of multivariate sub-Gaussian data that are accurate at small sample sizes.
Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection
In robust mean estimation the goal is to estimate the mean $\mu$ of a distribution on $\mathbb{R}^d$ given $n$ independent samples, an $\varepsilon$-fraction of which have been corrupted by a malicious adversary.
COPT: Coordinated Optimal Transport for Graph Sketching
We introduce COPT, a novel distance metric between graphs defined via an optimization routine, computing a coordinated pair of optimal transport maps simultaneously.
A Study of Performance of Optimal Transport
We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph.
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search
In this paper, we introduce SANNS, a system for secure $k$-NNS that keeps client's query and the search result confidential.
COPT: Coordinated Optimal Transport on Graphs
We introduce COPT, a novel distance metric between graphs defined via an optimization routine, computing a coordinated pair of optimal transport maps simultaneously.
SLM: End-to-end Feature Selection via Sparse Learnable Masks
Feature selection has been widely used to alleviate compute requirements during training, elucidate model interpretability, and improve model generalizability.
LANISTR: Multimodal Learning from Structured and Unstructured Data
Multimodal large-scale pretraining has shown impressive performance for unstructured data including language, image, audio, and video.
