Statistical Learning
OPERA: Automatic Offline Policy Evaluation with Re-weighted Aggregates of Multiple Estimators
Unfortunately, choosing the best OPE algorithm for each task and domain is still unclear.
Probabilistic Invariant Learning with Randomized Linear Classifiers
Combined, these features provide both theoretical and practical simplicity.
From Dictionary to Tensor: A Scalable Multi-View Subspace Clustering Framework with Triple Information Enhancement Zhibin Gu
Second, previous techniques have utilized the given feature matrix as the dictionary for subspace recovery.
Unconstrained Dynamic Regret via Sparse Coding
Nonstationarity is prevalent in sequential decision making, which poses a critical challenge to the vast majority of existing approaches developed offline.
CSPG: Crossing Sparse Proximity Graphs for Approximate Nearest Neighbor Search
An efficient two-staged approach is designed for exploring CSPG, with fast approaching and cross-partition expansion.
