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

55109164218 · Jun 202019922001200920172026
48 results for infill selection

A new method for high-dimensional Bayesian optimization.

problem Challenges in extending BO to high dimensions.
method Expected Coordinate Improvement (ECI) criterion for high-dimensional Bayesian optimization.
result Significantly better results than standard BO and competitive results with state-of-the-art methods.

Physical systems are modelled and investigated within simulation software in an increasing range of applications. In reality an investigation of the system is often performed by empirical test scenarios which are related to typical situations. Our aim is to derive a method which generates diverse test scenarios each re…

2018-10-04abs ↗pdf ↗

ICP improves text infilling and POS tagging with valid confidence sets.

problem Statistical reliability of machine learning predictions.
method Inductive conformal prediction algorithms for text infilling and POS tagging.
result Valid set-valued predictions with small size for real-world applications.

Recent years have seen remarkable progress of text generation in different contexts, such as the most common setting of generating text from scratch, and the emerging paradigm of retrieval-and-rewriting. Text infilling, which fills missing text portions of a sentence or paragraph, is also of numerous use in real life, …

2019-01-01abs ↗pdf ↗

Paper introduces TtT, market-implied transition time, from greenium term structure.

problem Estimating market-implied transition time to a low-carbon economy.
method Develops inference theory for TtT, introduces two stochastic models.
result Combines two-layer analysis for consistent estimation of diffusion parameters.

Model infers mineral locations from geospatial data, improving predictions with auxiliary data.

problem Challenges in characterizing hidden mineral deposits underground.
method Generative modeling approach using masked and infilled geospatial maps.
result Models achieve Dice coefficients of 0.31 and recalls of 0.22 at 1×1 mi² resolution.

Unified perspective unites Bayesian optimization and active learning for efficient goal-oriented optimization.

problem Efficiently optimize expensive engineering and scientific problems with limited data.
method Unified framework linking Bayesian infill criteria and active learning criteria.
result Unified approach formalizes Bayesian infill criteria and active learning criteria.

A scalable portfolio approach speeds up Bayesian optimization for noisy functions.

problem Efficiently selecting multiple designs in parallel for noisy, expensive black-box optimization.
method A portfolio approach that balances exploration and exploitation, using a scalable allocation strategy.
result Significant speed improvements over existing methods, with similar or better performance.

Bayesian Optimization tackles hidden constraints in architecture optimization.

problem Optimizing system architectures with hidden constraints using expensive physics-based simulations.
method Surrogate-based optimization with Gaussian Process models, including strategies for handling failed evaluations.
result Best performance achieved with a mixed-discrete GP predicting Probability of Viability (PoV) and minimum PoV threshold selection.

Scalarizing functions have been widely used to convert a multiobjective optimization problem into a single objective optimization problem. However, their use in solving (computationally) expensive multi- and many-objective optimization problems in Bayesian multiobjective optimization is scarce. Scalarizing functions ca…

2019-04-11abs ↗pdf ↗

Study improves accuracy of weather data for real-time building simulations.

problem Anomalous and missing weather data affect real-time building energy simulations.
method Introduces a framework for quality control of measured weather data using anomaly detection and neural network infilling.
result Neural Networks enhance the accuracy of data imputation compared to traditional methods.

We use SMC with twist functions to improve probabilistic inference in LLMs.

problem Improving probabilistic inference in large language models.
method We use Sequential Monte Carlo with learned twist functions to estimate expected future values and focus inference on promising sequences.
result Twisted SMC improves the accuracy of language model inference and evaluation.

Diffusion models generate music sequences without autoregressive loops.

problem Generating music sequences from symbolic data using diffusion models.
method Parameterize discrete symbolic data in continuous latent space, train diffusion model, generate sequences through reverse process.
result Strong unconditional generation and post-hoc conditional infilling compared to autoregressive models.

Sparse Gaussian process quantile regression tackles computational challenges in Bayesian quantile regression.

problem Nonconjugacy and computational cost in Gaussian process quantile regression.
method Sparse Gaussian process framework with Laplace approximation, adaptive inducing-input placement, and sequential data acquisition.
result Accuracy of Laplace approximation and effectiveness of adaptive mechanisms in reducing predictive uncertainty.

New method boosts performance of diffusion models on discrete data like natural language.

problem Performance of diffusion models on discrete data like natural language is poor.
method Proposes score entropy, a novel loss that extends score matching to discrete spaces.
result Significantly boosts performance on language modeling tasks.

Proposes a method to improve surrogate modeling and design optimization using latent variables.

problem Improving efficiency in multi-fidelity adaptive sampling without hierarchical assumptions.
method A framework using a latent variable Gaussian process to capture correlations between different fidelity models and optimize adaptive sampling.
result Demonstrates superior performance in convergence rate and robustness compared to existing methods.

Proposes PEMI for online selective conformal prediction with asymmetric rules.

problem Challenges of handling asymmetric selection mechanisms in online selective conformal prediction.
method PEMI: permutation-based framework for selective conformal prediction with arbitrary asymmetric selection rules.
result Achieves exact selection-conditional coverage for any asymmetric selection mechanism and any prediction model.

The paper addresses errors in online selective conformal prediction and proposes new strategies to ensure valid inference.

problem Online selective conformal prediction's exchangeability issues and false coverage rate control problems.
method Evaluation and correction of existing calibration selection strategies, proposing new ones that preserve exchangeability.
result Novel calibration selection strategies ensure both selection-conditional coverage and FCR control.

This work develops scalable model selection methods with fast update and selection.

problem Efficient model selection for large pools of candidate models.
method Isolated model embedding, which supports asymptotically fast update and selection.
result Standardized Embedder achieves competitive model selection performances.

Online method selects candidates from data streams, ensuring irreversible decisions.

problem Conformal selection's incompatibility with irreversible decisions in online scenarios.
method Online Conformal Selection with Accept-to-Reject Changes (OCS-ARC) incorporating online Benjamini-Hochberg procedure.
result OCS-ARC controls FDR at or below nominal level, improving selection power.

Paper proposes a statistical test for feature selection pipelines using selective inference.

problem Assessing the significance of feature selection pipelines in data analysis.
method Selective inference technique applied to feature selection pipelines composed of various algorithms.
result The proposed statistical test controls false positive feature selection probabilities.

We develop a general approach to valid inference after model selection. At the core of our framework is a result that characterizes the distribution of a post-selection estimator conditioned on the selection event. We specialize the approach to model selection by the lasso to form valid confidence intervals for the sel…

2013-11-25abs ↗pdf ↗

Recently, many regularized procedures have been proposed for variable selection in linear regression, but their performance depends on the tuning parameter selection. Here a criterion for the tuning parameter selection is proposed, which combines the strength of both stability selection and cross-validation and therefo…

2013-01-30abs ↗pdf ↗

Develops a more powerful selective inference method for stepwise feature selection.

problem Loss of power in existing conditional SI methods due to over-conditioning.
method Uses homotopy continuation approach to overcome over-conditioning.
result Shows improved power and efficiency in selective inference for feature selection.

Online selection of dynamic features has attracted intensive interest in recent years. However, existing online feature selection methods evaluate features individually and ignore the underlying structure of feature stream. For instance, in image analysis, features are generated in groups which represent color, texture…

2016-08-21abs ↗pdf ↗