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

Trend · papers per month

4998146195 · Jun 202019922001200920172026
48 results for comprehensive search

Improved equation learning accuracy via comprehensive R²-elimination and Bayesian model selection.

problem Challenges in exhaustive equation learning due to multicollinearity and greedy steps.
method Combines R2R^2 and Bayesian model evidence for a comprehensive yet efficient search.
result Our approach surpasses all other methods in identification accuracy, especially in exact equation recovery.

Weight-sharing is rarely helpful in NAS, especially on small datasets.

problem The efficiency of weight-sharing in Neural Architecture Search (NAS) is questionable.
method Comparison of a state-of-the-art weight-sharing approach to random search on the nasbench dataset.
result Weight-sharing is only rarely significantly helpful in NAS, highlighting the importance of the search space.

NEMoTS improves time series analysis by deriving efficient, interpretable models.

problem Lack of comprehensive understanding and insightful explanations in time series analysis.
method Neural-enhanced Monte-Carlo Tree Search (NEMoTS) for symbolic regression.
result NEMoTS provides efficient and interpretable models for time series analysis.

Code search and comprehension have become more difficult in recent years due to the rapid expansion of available source code. Current tools lack a way to label arbitrary code at scale while maintaining up-to-date representations of new programming languages, libraries, and functionalities. Comprehensive labeling of sou…

2019-06-03abs ↗pdf ↗

Inverted file and asymmetric distance computation (IVFADC) have been successfully applied to approximate nearest neighbor search and subsequently maximum inner product search. In such a framework, vector quantization is used for coarse partitioning while product quantization is used for quantizing residuals. In the ori…

2019-03-25abs ↗pdf ↗

The growing interest in both the automation of machine learning and deep learning has inevitably led to the development of a wide variety of automated methods for neural architecture search. The choice of the network architecture has proven to be critical, and many advances in deep learning spring from its immediate im…

2019-05-04abs ↗pdf ↗

Method predicts disease outbreaks using search logs, overcoming instability.

problem Predicting disease outbreaks from search logs is challenging due to short-term and long-term instability.
method Seasonal-adjustment method decomposes logs into seasonal, trend, and irregular components; feature selection method selects relevant search terms.
result Proposed method outperforms comparative methods in prediction accuracy for seven of ten diseases.

Study compares variable selection methods for model evaluation and search.

problem Understanding underlying mechanisms in scientific questions through variable selection.
method Comprehensive comparison of BIC and AIC for model evaluation and various search methods (exhaustive, greedy, LASSO path, stochastic search) for model space exploration.
result Exhaustive search BIC and stochastic search BIC outperform other methods in small and large model spaces, respectively, improving correct identification rate and reducing false discovery rate.

A major challenge in current optimization research for deep learning is to automatically find optimal step sizes for each update step. The optimal step size is closely related to the shape of the loss in the update step direction. However, this shape has not yet been examined in detail. This work shows empirically that…

2019-03-28abs ↗pdf ↗

This work benchmarks and theorizes robust NAS under adversarial training.

problem Lack of benchmark evaluations and theoretical guarantees for robust NAS architectures under adversarial training.
method Released a comprehensive data set and established a generalization theory using the neural tangent kernel.
result Established a generalization theory for robust NAS architectures under adversarial training.

Content based image retrieval, a technique which uses visual contents of image to search images from large scale image databases according to users' interests. This paper provides a comprehensive survey on recent technology used in the area of content based face image retrieval. Nowadays digital devices and photo shari…

2014-02-20abs ↗pdf ↗

The search of unconventional magnetic and nonmagnetic states is a major topic in the study of frustrated magnetism. Canonical examples of those states include various spin liquids and spin nematics. However, discerning their existence and the correct characterization is usually challenging. Here we introduce a machine-…

2018-04-23abs ↗pdf ↗

Study compares MAPF and MARL algorithms for warehouse automation.

problem Optimizing multi-agent pickup and delivery in warehouse settings.
method Compared conflict-based search (MAPF) and shared experience actor-critic (MARL).
result Comprehensive benchmarking of MAPF and MARL in a simulated warehouse environment.

Machine learning (ML) methods have been developing rapidly, but configuring and selecting proper methods to achieve a desired performance is increasingly difficult and tedious. To address this challenge, automated machine learning (AutoML) has emerged, which aims to generate satisfactory ML configurations for given tas…

2018-10-31abs ↗pdf ↗

Cross-referencing, which links passages of text to other related passages, can be a valuable study aid for facilitating comprehension of a text. However, cross-referencing requires first, a comprehensive thematic knowledge of the entire corpus, and second, a focused search through the corpus specifically to find such u…

2019-05-18abs ↗pdf ↗

The paper introduces a method for fitting complex models using simulation and optimization.

problem Fitting models with intractable likelihood or moments.
method Sequential sampling and local smoothing, combining global and local search phases.
result The proposed method outperforms alternative approaches in fitting complex models.

BNAS improves neural architecture search with a scalable, fast, and efficient approach.

problem Efficiently searching for optimal neural architectures with high performance and low training time.
method Designing a broad scalable architecture (BCNN) with reinforcement learning and parameter sharing, and developing two variants.
result Significantly reduces training time and achieves state-of-the-art performance on CIFAR-10 and ImageNet.

MBExplainer provides explanations for models combining graph embeddings and tabular features.

problem Explaining models using a mix of graph embeddings and tabular features.
method Model-agnostic approach using Shapley values and Monte Carlo Tree Search.
result MBExplainer efficiently finds human-readable explanations for model predictions.

Mathematical Reinforcement Learning faces a 'Two-Hump' problem due to sparse rewards and a scarcity of intermediate 'hard-but-solvable' instances.

problem Mathematical search problems in Reinforcement Learning
method Novel data generation techniques and algorithmic enhancements
result Substantial performance improvements over previous baselines

Systematic review of multimodal data challenges and solutions.

problem Challenges in integrating diverse data types for improved diagnostics and personalized care.
method Synthesizing findings from 69 studies on technical obstacles and recent methodological advances.
result Promising solutions like transfer learning, generative models, attention mechanisms, and neural architecture search.

RiskMiner discovers formulaic alphas using MCTS for better performance.

problem Mining formulaic alphas without considering structural information and alpha correlations.
method Formulates alpha mining as an MDP and solves it with a risk-seeking MCTS.
result Our method outperforms state-of-the-art benchmarks and achieves the most profitable results.

In this paper, we propose a new product knowledge graph (PKG) embedding approach for learning the intrinsic product relations as product knowledge for e-commerce. We define the key entities and summarize the pivotal product relations that are critical for general e-commerce applications including marketing, advertiseme…

2019-11-28abs ↗pdf ↗

Analyzing a comprehensive news dataset, we document that joint news coverage triggers attention contagion, causing temporarily inflated valuations for affected stocks. Tracing SEC EDGAR visits from unique IPs, we provide direct evidence of attention spillovers between stocks. Stocks with greater joint news coverage exh…

2017-03-08abs ↗pdf ↗

With the success of deep neural networks, Neural Architecture Search (NAS) as a way of automatic model design has attracted wide attention. As training every child model from scratch is very time-consuming, recent works leverage weight-sharing to speed up the model evaluation procedure. These approaches greatly reduce …

2020-01-06abs ↗pdf ↗

Paper proposes verifier engineering for improving foundation models.

problem Challenges in providing effective supervision signals for foundation models.
method Leverages automated verifiers to perform verification tasks and deliver feedback.
result Verifier engineering can enhance foundation models' capabilities.

The ability to rank candidate architectures is the key to the performance of neural architecture search~(NAS). One-shot NAS is proposed to reduce the expense but shows inferior performance against conventional NAS and is not adequately stable. We investigate into this and find that the ranking correlation between archi…

2019-09-24abs ↗pdf ↗

This paper improves auto-augment efficiency by sharing augmentation weights.

problem Efficient evaluation of augmentation policies for model training.
method Augmentation-Wise Weight Sharing (AWS) to create a fast yet accurate proxy task.
result Augmentation policies found achieve superior accuracies compared to existing methods.

Neural models often incorrectly predict the same answer to subtly changed questions, even when they should not.

problem Neural models' oversensitivity to adversarial question changes.
method Formulated a noisy adversarial attack to identify and exploit undersensitivity, tested with data augmentation and adversarial training.
result Undersensitivity can be exploited to mislead models, and addressing it improves model performance and robustness.

TFB simplifies Bayesian LLM uncertainty estimation without extra training.

problem Estimating uncertainty in LLM responses remains challenging.
method Training-Free Bayesianization (TFB) that transforms low-rank adapters into Bayesian ones without additional training.
result TFB achieves superior uncertainty estimation and generalization compared to existing methods.

The study examines causal razors and their logical relations, highlighting a dilemma in causal discovery.

problem Selecting a reasonable scoring criterion for causal discovery algorithms.
method Review and logical comparison of numerous causal razors, focusing on parameter minimality in multinomial models.
result Parameter minimality poses a dilemma in selecting a reasonable scoring criterion for causal discovery algorithms.

In many domains where data are represented as graphs, learning a similarity metric among graphs is considered a key problem, which can further facilitate various learning tasks, such as classification, clustering, and similarity search. Recently, there has been an increasing interest in deep graph similarity learning, …

2019-12-25abs ↗pdf ↗

The paper develops a scalable method to infer GRNs from sparse data.

problem Inferring complex gene regulatory networks from limited and temporally sparse data.
method Bayesian optimization and kernel-based methods to construct a Gaussian Process (GP) model.
result The method efficiently searches for the topology with the highest likelihood value.