Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

91182273364 · Jun 202019922001200920172026
48 results for interactive test

Automated tests detect interactions in unstructured data.

problem Detecting interactions between latent variables in low-dimensional systems.
method Derive two interaction tests based on pairwise interventions and integrate them into an active learning pipeline.
result Tests can identify more known biological interactions than random search and standard active learning baselines.

We study the power of interactivity in local differential privacy. First, we focus on the difference between fully interactive and sequentially interactive protocols. Sequentially interactive protocols may query users adaptively in sequence, but they cannot return to previously queried users. The vast majority of exist…

2019-04-07abs ↗pdf ↗

We introduce kernel nonparametric tests for Lancaster three-variable interaction and for total independence, using embeddings of signed measures into a reproducing kernel Hilbert space. The resulting test statistics are straightforward to compute, and are used in powerful interaction tests, which are consistent against…

2013-06-10abs ↗pdf ↗

New methods test discrete distributions faster with local privacy constraints.

problem Testing discrete distributions under local differential privacy constraints.
method Efficient randomized algorithms and test procedures, both non-interactive and interactive.
result Faster separation rates in interactive privacy mechanisms.

Framework certifies fairness of machine learning models interactively and privately.

problem Certifying fairness of machine learning models in privacy-preserving scenarios.
method Interactive test with cryptographic techniques for fairness certification.
result Empirical evaluation of fairness for various models and definitions.

Proposes a two-stage method for testing variable interactions with FDR control.

problem Testing pairwise interactions in high-dimensional data with dependence.
method Two-stage testing procedure with FDR control using Cramér type moderate deviation technique.
result The proposed method controls FDR and has comparable or improved statistical power.

Paper resolves open problems on sample complexity in binary hypothesis testing.

problem Open problems in distributed simple binary hypothesis testing under information constraints.
method One-shot lower bound on Bayes error, streamlined sample complexity formula, reverse data-processing inequality.
result Optimally tight sample complexity bounds for communication-constrained simple binary hypothesis testing.

To date, testing interactions in high dimensions has been a challenging task. Existing methods often have issues with sensitivity to modeling assumptions and heavily asymptotic nominal p-values. To help alleviate these issues, we propose a permutation-based method for testing marginal interactions with a binary respons…

2012-06-27abs ↗pdf ↗

We consider the problem of comparing probability densities between two groups. A new probabilistic tensor product smoothing spline framework is developed to model the joint density of two variables. Under such a framework, the probability density comparison is equivalent to testing the presence/absence of interactions.…

2019-11-06abs ↗pdf ↗

Detection of interactions between treatment effects and patient descriptors in clinical trials is critical for optimizing the drug development process. The increasing volume of data accumulated in clinical trials provides a unique opportunity to discover new biomarkers and further the goal of personalized medicine, but…

2017-12-21abs ↗pdf ↗

This paper explores the information-theoretic limitations of graph property testing in zero-field Ising models. Instead of learning the entire graph structure, sometimes testing a basic graph property such as connectivity, cycle presence or maximum clique size is a more relevant and attainable objective. Since property…

2017-09-20abs ↗pdf ↗

This paper applies combinatorial testing to machine learning for robust model performance.

problem Identifying robust machine learning models using test and training sets.
method Adapting combinatorial interaction testing for machine learning, focusing on simple features.
result Combinatorial coverage can enhance model performance and robustness.

We present an approach for building an active agent that learns to segment its visual observations into individual objects by interacting with its environment in a completely self-supervised manner. The agent uses its current segmentation model to infer pixels that constitute objects and refines the segmentation model …

2018-06-21abs ↗pdf ↗

We apply a wild bootstrap method to the Lancaster three-variable interaction measure in order to detect factorisation of the joint distribution on three variables forming a stationary random process, for which the existing permutation bootstrap method fails. As in the i.i.d. case, the Lancaster test is found to outperf…

2016-03-02abs ↗pdf ↗

We study "active" decision making over sensor networks where the sensors' sequential probing actions are actively chosen by continuously learning from past observations. We consider two network settings: with and without central coordination. In the first case, the network nodes interact with each other through a centr…

2018-09-12abs ↗pdf ↗

CAZSL learns to generalize physical interactions from context.

problem Designing models that can generalize over unknown objects during manipulation.
method Context-aware zero-shot learning using Siamese network architecture, embedding space masking, and regularization.
result CAZSL models can generalize to different parameters or features of interacting objects.

Collective classification models attempt to improve classification performance by taking into account the class labels of related instances. However, they tend not to learn patterns of interactions between classes and/or make the assumption that instances of the same class link to each other (assortativity assumption).…

2012-09-25abs ↗pdf ↗

Proposes a new machine learning-based method for conjoint analysis.

problem Testing the importance of factors in conjoint analysis with interactions.
method Conditional randomization test based on machine learning algorithms.
result Validates the importance of factors in conjoint analysis without model specification.

Federated Granger causality learns reliable interactions without sharing data.

problem Uncertainty in federated Granger causality estimates.
method Closed-form covariance recursions and spectral-radius-based convergence conditions.
result Uncertainty depends only on client data statistics and is independent of model parameters.

The paper studies inference in hypergraph β-models with multiple layers.

problem Estimating and testing in hypergraph β-models with degree heterogeneity.
method Maximum likelihood estimation and likelihood ratio test for hypergraph β-models with multiple layers.
result The ML estimate and LR test are optimally powerful under the null hypothesis.

Interactive weak supervision learns useful heuristics from user feedback.

problem Creating useful heuristics for large labeled datasets is tedious and subjective.
method Develops an interactive framework for learning heuristics from user feedback.
result Only a few feedback iterations are needed to train models without ground truth labels.

New method learns particle system potentials from unlabeled data.

problem Learning potentials of interacting particle systems from unlabeled data with trajectory information missing.
method Introduces a self-test loss function based on stochastic evolution equation.
result Method outperforms baseline methods in robust estimation of large, high-dimensional systems.

Agent-based model compares different COVID-19 testing policies and their effectiveness.

problem Understanding how different testing policies reveal the true number of infected cases.
method Developed an agent-based simulation framework in Python to model various testing policies and interventions.
result Contact Tracing consistently captures more positive cases than Random Symptomatic Testing, and LBT performs similarly.

AutoFIS automatically selects important feature interactions for CTR prediction models.

problem Manual feature interaction design is inefficient and prone to noise.
method Two-stage algorithm: search stage relaxes feature interactions to continuous parameters, re-train stage refines model performance.
result AutoFIS significantly improves CTR and CVR of FM-based models.

New KNN test improves association analysis of high-dimensional sequencing data.

problem Challenges in using neural networks for high-dimensional sequencing data analysis.
method Kernel-based neural network (KNN) test for complex association analysis.
result KNN test outperforms SKAT in detecting non-linear and interaction effects.

AI agents on social networks rarely engage in extended conversations.

problem Understanding the persistence of interactions in AI-agent social networks.
method Analysis of Moltbook, a social network of AI agents, using interaction half-life and spectral tests.
result Most comments on Moltbook receive a direct reply within seconds, indicating a ``fast response or silence'' regime.

New method quantifies feature interactions in machine learning models.

problem Capturing high-order interactions and feature contributions in predictive models.
method Information-theoretic approach using Conditional Mutual Information (CMI) via k-NN.
result Accurately recovers feature interactions in synthetic and real-world datasets.

Feature maps, that preserve the global topology of arbitrary datasets, can be formed by self-organizing competing agents. So far, it has been presumed that global interaction of agents is necessary for this process. We establish that this is not the case, and that global topology can be uncovered through strictly local…

2019-02-11abs ↗pdf ↗

In many data exploration tasks it is meaningful to identify groups of attribute interactions that are specific to a variable of interest. For instance, in a dataset where the attributes are medical markers and the variable of interest (class variable) is binary indicating presence/absence of disease, we would like to k…

2016-12-22abs ↗pdf ↗