Active learning optimizes correlation clustering by querying the most informative pairwise comparisons.
problem Efficiently clustering data with limited pairwise similarity information.
method Developed principled active learning approach using information-theoretic acquisition functions.
result Significantly outperforms existing baselines in clustering accuracy and query efficiency.
Paper develops active learning for clustering unknown pairwise similarities.
problem Learning positive and negative pairwise similarities efficiently.
method Generic active learning framework for correlation clustering.
result Demonstrates effectiveness of query strategies in clustering.
In correlation clustering, we are given n objects together with a binary similarity score between each pair of them. The goal is to partition the objects into clusters so to minimise the disagreements with the scores. In this work we investigate correlation clustering as an active learning problem: each similarity sc…
We study the problem of recovering the structure underlying large Gaussian graphical models or, more generally, partial correlation graphs. In high-dimensional problems it is often too costly to store the entire sample covariance matrix. We propose a new input model in which one can query single entries of the covarian…
We study power-law correlations properties of the Google search queries for Dow Jones Industrial Average (DJIA) component stocks. Examining the daily data of the searched terms with a combination of the rescaled range and rescaled variance tests together with the detrended fluctuation analysis, we show that the searche…
We propose an approximation algorithm for efficient correlation search in time series data. In our method, we use Fourier transform and neural network to embed time series into a low-dimensional Euclidean space. The given space is learned such that time series correlation can be effectively approximated from Euclidean …
This paper models the crowdsourced labeling/classification problem as a sparsely encoded source coding problem, where each query answer, regarded as a code bit, is the XOR of a small number of labels, as source information bits. In this paper we leverage the connections between this problem and well-studied codes with …
Solves TOD systems' query annotation problem without explicit annotations.
problem Training TOD systems without explicit KB query annotation.
method Reinforcement learning (RL) and pipelined approach for query prediction and system training.
result Improved RL agent with modifications for TOD tasks.
This study examines how sequential correlations affect in-context learning in sequence models.
problem Understanding how in-context learning works with sequentially correlated data.
method Extended linear regression model to sequentially correlated data, tested on transformer architectures.
result Sequential correlations alter the effective context length and attention architecture effectiveness.
Efficiently clusters noisy data with minimal queries.
problem Clustering elements with noisy oracle feedback.
method Combination of sampling strategy and correlation clustering algorithm.
result First polynomial-time algorithms for NP-hard optimization problem.
We propose a new localized inference algorithm for answering marginalization queries in large graphical models with the correlation decay property. Given a query variable and a large graphical model, we define a much smaller model in a local region around the query variable in the target model so that the marginal dist…
Study exact partition recovery with same-cluster oracle, bounded error.
problem Exact recovery of partitions with same-cluster oracle in adversarial error.
method Novel connection to correlation clustering, Rényi-Ulam framework, upper and lower bounds, randomized algorithm analysis, adaptivity-query complexity study.
result Upper and lower bounds on worst-case query complexity, expected performance bounds of randomized algorithm.
Corella protects client data privacy in multi-server learning with correlated queries.
problem Protecting client data privacy in multi-server machine learning.
method Proposes a private multi-server learning approach using correlated queries and strong noise.
result Mitigates client data leakage with high accuracy and minimal computational effort.
A new system combines vision and language for person re-identification.
problem Real-world surveillance lacks visual data for person re-identification.
method Two-stream CNN framework with shared logits, CCA for modalities, multi-modal testing protocol.
result 22% improvement in re-identification performance with multi-modal queries.
It has been widely understood that differential privacy (DP) can guarantee rigorous privacy against adversaries with arbitrary prior knowledge. However, recent studies demonstrate that this may not be true for correlated data, and indicate that three factors could influence privacy leakage: the data correlation pattern…
New bounds show complex neural networks need many queries to learn.
problem Learning non-polynomial activation functions with Gaussian marginals.
method Gradient boosting procedure to amplify lower bounds on SQ dimension of neural networks.
result Statistical-query lower bounds for ReLU regression with 2ncε queries. Preformer improves Transformer for long-term time series forecasting.
problem Transformer's quadratic complexity and lack of context-awareness for long-term forecasting.
method Introduces Multi-Scale Segment-Correlation mechanism for efficient time series segmentation and context-aware attention.
result Preformer outperforms other Transformer-based methods in long-term time series forecasting.
Proposes a max-utility arm selection strategy for reducing cumulative regret in sequential query recommendations.
problem Reduces cumulative regret in sequential query recommendations for closed loop interactive learning settings.
method Proposes a max-utility arm selection strategy based on the maximum utility of arms.
result Improves cumulative regret substantially compared to baseline algorithms and random selection.
Attention improves edge prediction in e-commerce graphs.
problem Predicting edges in graphs from node attributes in e-commerce.
method Used attention mechanism in simple feedforward networks, derived analytically tractable model AttEST.
result Attention network outperforms LSTM architectures by over 20% on F-1 score.
New algorithm for clustering with faulty oracle achieves optimal queries and efficiency.
problem Clustering with a faulty oracle, especially for multiple clusters.
method Built on stochastic block model, provides nearly-optimal query complexity.
result Time-efficient algorithm with nearly-optimal query complexity for all constant k and any δ.
In this paper, we initiate a rigorous theoretical study of clustering with noisy queries (or a faulty oracle). Given a set of n elements, our goal is to recover the true clustering by asking minimum number of pairwise queries to an oracle. Oracle can answer queries of the form : "do elements u and v belong to the…
New algorithm learns disjunctions faster than previous methods.
problem Learning Boolean disjunctions in the agnostic PAC model.
method Developed an agnostic learner with complexity 2ildeO(n1/3). result First separation between SQ and CSQ models in distribution-free agnostic learning.
A new method selects models for ensemble learning to maximize mutual information, outperforming existing approaches.
problem Selecting models for ensemble learning to improve performance and reduce correlation issues.
method Formulate budgeted ensemble selection as maximizing mutual information, use Gaussian-copula to model correlated errors, propose a greedy mutual-information selection algorithm.
result Our method consistently outperforms strong baselines across multiple datasets.
In many networks, vertices have hidden attributes, or types, that are correlated with the networks topology. If the topology is known but these attributes are not, and if learning the attributes is costly, we need a method for choosing which vertex to query in order to learn as much as possible about the attributes of …
We live in a computerized and networked society where many of our actions leave a digital trace and affect other people's actions. This has lead to the emergence of a new data-driven research field: mathematical methods of computer science, statistical physics and sociometry provide insights on a wide range of discipli…
Portfolio diversification and active risk management are essential parts of financial analysis which became even more crucial (and questioned) during and after the years of the Global Financial Crisis. We propose a novel approach to portfolio diversification using the information of searched items on Google Trends. The…
Estimates neural architecture performance speedily.
problem Accurately evaluating neural architectures' generalization performance.
method Estimates final test performance based on training speed.
result Consistently outperforms other alternatives in correlation with true test performance.
Improves search performance by transferring knowledge from recommender system.
problem Cold start and feedback loop problems in search retrieval.
method Zero-Shot Heterogeneous Transfer Learning framework.
result Significant improvements in relevance and user interactions over production system.
Previous work has shown that popular trending events are important external factors which pose significant influence on user search behavior and also provided a way to computationally model this influence. However, their problem formulation was based on the strong assumption that each event poses its influence independ…
BMBO-DARN optimizes expensive functions with varying fidelities.
problem Optimizing expensive, multi-fidelity functions efficiently.
method Batch Multi-fidelity Bayesian Optimization with Deep Auto-Regressive Networks.
result BMBO-DARN improves surrogate learning and optimization performance.
Embedding methods which enforce a partial order or lattice structure over the concept space, such as Order Embeddings (OE) (Vendrov et al., 2016), are a natural way to model transitive relational data (e.g. entailment graphs). However, OE learns a deterministic knowledge base, limiting expressiveness of queries and the…
New DP methods for estimating means and frequencies with varying privacy demands.
problem Estimating statistics with users having different privacy requirements.
method Proposes algorithms for empirical mean and frequency estimation under heterogeneous privacy constraints, considering both correlated and permuted datasets.
result Establishes theoretical performance guarantees for algorithms, achieving minimax optimality.
Paper presents a technique using Spearman's Rank Correlation Coefficient for KE in TDs.
problem Extracting common characteristics and grouping similar TDs.
method Spearman's Rank Correlation Coefficient (SRCC) for KE.
result SRCC proves a comprehensive measure for high-quality KE.
This paper uses LLMs for causal discovery with active learning and dynamic scoring to improve efficiency and fairness.
problem High computational demands and complexities of large-scale data in causal discovery.
method Metadata-based approach, BFS strategy, Active Learning, Dynamic Scoring Mechanism, LLM confidence scores.
result Significantly reduced number of queries and improved efficiency in causal graph construction.
Proves SQ lower bounds for learning two-hidden-layer neural networks.
problem Learning two-hidden-layer ReLU networks with Gaussian inputs.
method Refined lifting procedure to reduce Boolean PAC learning to Gaussian.
result Superpolynomial SQ lower bounds for Gaussian inputs.
New privacy method for eye tracking data reduces correlations and maintains accuracy.
problem Privacy concerns in eye tracking data from VR/AR glasses.
method Transform-coding based differential privacy mechanism for eye movement data.
result Significant reductions in sample correlations and query sensitivities, providing high privacy without loss in accuracy.
Multi-modal data collections, such as corpora of paired images and text snippets, require analysis methods beyond single-view component and topic models. For continuous observations the current dominant approach is based on extensions of canonical correlation analysis, factorizing the variation into components shared b…
New method improves multi-fidelity Bayesian optimization by accounting for local correlations and varying noise.
problem Existing multi-fidelity Bayesian optimization methods assume global correlation and constant noise, which limits performance.
method Proposes an MF emulation method that learns noise models for each data source and leverages locally correlated LF sources.
result Improves performance of multi-fidelity Bayesian optimization by accounting for local correlations and varying noise.
Algorithm learns arbitrary ReLU neurons under Gaussian inputs.
problem Learn an arbitrary ReLU activation over Gaussian marginals.
method Statistical Query (SQ) algorithm that outputs a ReLU activation achieving O(OPT)+ε loss. result First constant factor approximation for arbitrary bias in polynomial time.
Neural network learns low-dimensional polynomials with SGD near information-theoretic limit.
problem Learning a single-index target function with gradient descent.
method Two-layer neural network optimized by SGD on squared loss.
result Sample and runtime complexity of n≃T=Θ(d⋅polylogd) for polynomial single-index models, matching information theoretic limit up to polylogarithmic factors. The paper tackles sequential mode estimation with oracle queries.
problem Adaptively PAC-learning a probability distribution's mode.
method Two query models: index queries and pair queries. Sequential algorithms for mode estimation.
result Lower bounds on optimal query complexity for both models.
Study exact community recovery in noisy SBM with limited queries.
problem Community recovery in noisy stochastic block models with limited queries.
method Balanced uniform querying, two-stage adaptive strategy, sublinear queries, subsampled graph.
result Adaptive querying can improve exact recovery limits in noisy SBM.
Efficiently classifies binary labels with XOR queries, even under noisy conditions.
problem Binary classification with unknown labels using XOR queries.
method Effective query type and an efficient inference algorithm for noisy conditions.
result Achieves information-theoretic limit on optimal number of queries.
ProbETA models travel time correlations between trips for better navigation.
problem Trip correlations not captured by existing methods.
method Deep hierarchical joint probabilistic model with learnable link representations.
result ProbETA outperforms state-of-the-art methods with 12.60% MAPE reduction.
Information retrieval (IR) systems often leverage query data to suggest relevant items to users. This introduces the possibility of unfairness if the query (i.e., input) and the resulting recommendations unintentionally correlate with latent factors that are protected variables (e.g., race, gender, and age). For instan…
Proposes a new query autocompletion method that maximizes retrieval performance.
problem Users often select suboptimal queries due to unknown best retrieval performance.
method Formulates query autocompletion as ranking item rankings, uses counterfactual learning.
result Empirical results show improved query suggestions for better retrieval performance.
Adapts large transformer model for search query intent understanding.
problem Understanding and predicting user intents from search queries.
method Adapts BERT-like architecture for search queries, accounts for query noisiness and sparseness.
result Builds a shareable deep learning model for query intent identification.
A new method for private query release using Johnson-Lindenstrauss projection.
problem Private release of query answers with minimal privacy loss.
method Random projection of query answers to a lower dimension, followed by noise addition.
result Optimal worst-case sample complexity for answering a workload of k queries.