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,694 papers · 148 categories

Trend · papers per month

16324864 · Jun 202019922001200920172026
48 results for discovery assistant

Proposes a new method to control FDR using frequentist-assisted horseshoe for high-dimensional testing.

problem Designing tests with frequentist false discovery rate control using horseshoe prior.
method Frequentist-assisted horseshoe procedure for high-dimensional normal means testing.
result Consistently achieves robust finite-sample FDR control in various sparse cases.

The paper proposes a method to predict the performance of data-driven algorithms using surrogate models.

problem Improving the performance prediction of data-driven knowledge discovery algorithms.
method Surrogate-assisted performance prediction using evolutionary modeling of clinical pathways.
result The proposed approach provides interpretable prediction of algorithm performance and quality.

This paper introduces a new system for discovering patterns in morphogenetic systems using modular architecture and unsupervised learning.

problem Discovering novel patterns in morphogenetic systems is challenging and often relies on manual tuning.
method Introduces a hierarchical, modular architecture for unsupervised learning of diverse representations combined with goal exploration algorithms.
result The new system efficiently adapts diversity search towards user preferences with minimal feedback.

LFD method improves text classification by making features clearer and less label-leaking.

problem Creating interpretable text representations that are both predictive and understandable.
method LFD method: proposes lexical and semantic features from contrastive text pairs, screens candidates using κκ, and selects features by residual gain.
result LFD features achieve higher human-human and human-LLM agreement than baseline concepts and are less label-leaking.

Computer-assisted synthesis planning aims to help chemists find better reaction pathways faster. Finding viable and short pathways from sugar molecules to value-added chemicals can be modeled as a retrosynthesis planning problem with a catalyst allowed. This is a crucial step in efficient biomass conversion. The tradit…

2019-11-10abs ↗pdf ↗

Framework evaluates AI proposals for drug discovery, finds no LLM advantage.

problem No principled framework exists for evaluating AI-guided scientific selection under budget constraints.
method Formally verified metric (BSDS/DQS) penalizes false discoveries and excessive abstention.
result LLMs provide no marginal value over existing classifiers in drug discovery.

Given the lack of evidence for new particle discoveries at the Large Hadron Collider (LHC), it is critical to broaden the search program. A variety of model-independent searches have been proposed, adding sensitivity to unexpected signals. There are generally two types of such searches: those that rely heavily on simul…

2020-01-14abs ↗pdf ↗

AI agents improve forecast combination in empirical economics.

problem Hidden researcher degrees of freedom in AI-generated code.
method Adapted agent-loop architecture to empirical economics, added holdout evaluation.
result Independent agent searches find better forecast methods than benchmarks.

Process mining is a research field focused on the analysis of event data with the aim of extracting insights in processes. Applying process mining techniques on data from smart home environments has the potential to provide valuable insights in (un)healthy habits and to contribute to ambient assisted living solutions. …

2016-09-12abs ↗pdf ↗

AI-Interpret transforms opaque policies into simple, interpretable decision rules.

problem Designing effective decision aids for professionals to mitigate decision-making biases.
method Combining imitation learning, program induction, and clustering to transform learned policies into interpretable descriptions.
result Providing interpretable decision rules as flowcharts significantly improves people's planning strategies and decisions.

Hopfield networks improve reaction template prediction for few/zero-shot scenarios.

problem Predicting reaction templates for new molecules in CASP.
method Adapted Hopfield networks to associate reaction templates, molecules, and structural information.
result Significantly improved performance for templates with few or zero training examples.

Humans prove theorems by relying on substantial high-level reasoning and problem-specific insights. Proof assistants offer a formalism that resembles human mathematical reasoning, representing theorems in higher-order logic and proofs as high-level tactics. However, human experts have to construct proofs manually by en…

2019-05-21abs ↗pdf ↗

Learning preferences implicit in the choices humans make is a well studied problem in both economics and computer science. However, most work makes the assumption that humans are acting (noisily) optimally with respect to their preferences. Such approaches can fail when people are themselves learning about what they wa…

2019-01-24abs ↗pdf ↗

Study evaluates the impact of academic support center's face-to-face assistance on student performance.

problem Underestimation of Academic Support Center's true impact due to group bias.
method Applied causal inference theory and T-learner to evaluate conditional average treatment effect (CATE) of F2F personal assistance.
result Developed a new CATE function that depends on the number of F2F sessions, predicting improved CATE performance.

AI assistants often give convincing but incorrect responses to match user beliefs.

problem Sycophancy in AI assistants that use human feedback.
method Examined five AI assistants across four tasks, analyzed human preference data, and compared model outputs against preference models.
result Sycophancy is a general behavior of AI assistants, driven in part by human preference judgments.

Develops a two-layer model to design mortgage assistance products.

problem Designing effective mortgage assistance products to improve household resilience.
method Two-layer approach: simulation and optimization.
result Shows how the approach can design and evaluate mortgage assistance products.

Polynomial chaos surrogates quantify epistemic uncertainty in AI-driven scientific models.

problem Uncertainty in reward estimates hinders interpretability in sequential generative models.
method Fit polynomial chaos expansions to trained models to propagate epistemic uncertainty and quantify sensitivity.
result Interpretable decomposition of reward components driving generative decisions.

AI-assisted interviews allow respondents to describe experiences naturally, but mapping those accounts into structured survey variables is fallible.

problem Mapping AI-assisted interview responses into structured survey variables is fallible.
method Adaptive Matrix Validation (AMV) is proposed, which involves mapping responses into tabular data and using a small set of structured questions for statistical adjustment.
result The estimator calibrates mapped values using validation answers from other respondents and corrects remaining error with validation answers observed for the target respondent.

A green simulation-assisted reinforcement learning method for biomanufacturing.

problem Complexity, high variability, lead time, and limited historical data in biopharmaceutical manufacturing.
method Quantifies model risk, uses posterior distribution, and selectively reuses simulation data.
result Demonstrates promising performance in online learning and decision making.

New method combines randomization tests and flexible models for valid inference without splitting data.

problem Valid inference in randomized panel experiments with complex effect heterogeneity.
method Model-assisted randomization tests that estimate unsigned CATE from residualized outcomes.
result CATE-assisted tests control Type I error and achieve higher power than alternatives.

A new method uses MCMC-assisted normalizing flows for efficient Bayesian sampling.

problem Sampling from complex posterior distributions in Bayesian statistics.
method Training a normalizing flow using direct KL divergence and MCMC assistance.
result The method improves sampling efficiency for complicated posterior distributions.

Due to the need for robust uncertainty quantification, Bayesian neural learning has gained attention in the era of deep learning and big data. Markov Chain Monte-Carlo (MCMC) methods typically implement Bayesian inference which faces several challenges given a large number of parameters, complex and multimodal posterio…

2018-11-21abs ↗pdf ↗

Improved speech recognition for voice assistants by analyzing speech data.

problem Reducing false triggers in speech-enabled assistants.
method Post-processing LVCSR hypothesis lattice with a Bidirectional Lattice Recurrent Neural Network (LatticeRNN).
result LatticeRNN significantly improves detection accuracy over traditional methods.

Measures policy-violating content prevalence with ML-assisted sampling and LLM labeling.

problem Accurate measurement of content violations that are often rare and costly to label.
method Design-based measurement system using ML-assisted probability sampling and LLM labeling.
result Produces unbiased prevalence estimates with confidence intervals and dashboard drilldowns.

GALA framework learns invariant graph representations via environment augmentation with minimal assumptions.

problem Learning invariant graph representations from different environments without additional assumptions.
method Developed GALA framework with minimal assumptions of variation sufficiency and consistency. Uses an assistant model to differentiate graph environment changes.
result Extracting maximally invariant subgraphs to proxy predictions identifies underlying invariant subgraphs for successful out-of-distribution generalization.