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

Trend · papers per month

1223 · Oct 201819922001200920172026
28 results for infilling

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 ↗

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 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.

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.

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.

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 ↗

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.

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.

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.