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

1122 · Jun 201919922001200920172026
27 results for learning-assisted

MEC-Cox: A Machine-Learning-Assisted Generalized Entropy Calibration Method for Estimating ATT Marginal Hazard-Ratio

problem Estimating ATT marginal hazard-ratio in externally controlled survival trials
method Machine-learning-assisted generalized entropy calibration for IPW Cox regression
result Reduces bias, increases efficiency, and improves coverage

INT benchmark tests theorem proving agents' ability to generalize to unseen theorems.

problem Evaluating theorem proving agents' ability to generalize to unseen theorems.
method INT benchmark based on a theorem generation and proof procedure with adjustable knobs for measuring 6 types of generalization.
result MCTS can help agents prove new theorems.

MEC improves efficiency and robustness in semi-supervised inference.

problem Efficient inference with limited labeled data and robust uncertainty quantification.
method Machine-Learning-Assisted Generalized Entropy Calibration (MEC) using cross-fitted, calibration-weighted PPI.
result MEC achieves semiparametric efficiency bounds under weaker assumptions and provides near-nominal coverage.

GPU-accelerated particle methods outperform neural samplers in LFT benchmarks.

problem High-dimensional multimodal sampling problems in lattice field theory.
method GPU-accelerated particle Monte Carlo methods (Sequential Monte Carlo and nested sampling).
result These methods match or outperform neural samplers in sample quality and wall-clock time.

Click-through rate (CTR) prediction is a critical task in online advertising systems. Most existing methods mainly model the feature-CTR relationship and suffer from the data sparsity issue. In this paper, we propose DeepMCP, which models other types of relationships in order to learn more informative and statistically…

2019-06-11abs ↗pdf ↗

New tests compare regression functions using machine learning, overcoming dimensionality issues.

problem Comparing regression functions in high-dimensional settings.
method Generalized kernel-based conditional mean dependence, machine learning methods for flexible estimation.
result Established asymptotic properties of tests under fixed and high-dimensional regimes.

Machine learning boosts RCT efficiency by controlling type I error and improving statistical power.

problem Improving statistical efficiency in RCTs with complex covariate adjustments.
method Machine learning-assisted adjustment under Rosenbaum's framework for exact tests.
result The proposed method robustly controls type I error and significantly boosts statistical efficiency.

Active learning improves neutron spectroscopy experiments by automating measurement selection.

problem Efficiently searching for signals in neutron scattering experiments with limited beam time.
method Probabilistic active learning using log-Gaussian processes.
result Automated selection of informative measurements improves experimental efficiency.

A machine-learning method speeds up RIS design by predicting reflection coefficients.

problem Extensive full-wave EM simulations are time-consuming for RIS design.
method Combining MLP and dual-port network to develop a fast model.
result The proposed method significantly reduces the time for RIS design.

Active inference uses machine learning to prioritize data labeling for more efficient statistical inference.

problem Efficiently collecting data points for statistical inference with limited labels.
method A machine learning-assisted approach that identifies uncertain data points for labeling.
result Achieves the same level of accuracy with fewer samples, resulting in smaller confidence intervals and more powerful p-values.

The paper proposes a method to learn evolving multivariate distributions from sample paths.

problem Learning the temporal evolution of multivariate densities from sample data.
method Normalizing flows to construct time-dependent mappings.
result The method can approximate evolving probability density functions from observed data.

A machine learning method selects optimal orthonormal bases for functional data analysis.

problem Lack of formal criteria for choosing initial orthonormal bases in functional data methods.
method Proposes a machine learning algorithm to learn and place knots for efficient orthogonal spline bases (splinets).
result Demonstrates efficiency, especially for sparse functional data and complex physical systems.

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.

The rise in machine learning-assisted decision-making has led to concerns about the fairness of the decisions and techniques to mitigate problems of discrimination. If a negative decision is made about an individual (denying a loan, rejecting an application for housing, and so on) justice dictates that we be able to as…

2019-09-07abs ↗pdf ↗

The paper proposes a machine learning framework for portfolio optimization with limited data.

problem Low data environments and regime uncertainty in portfolio optimization.
method A teacher-student learning pipeline with CVaR optimizer generating supervisory labels and neural models trained on real and synthetic data.
result Student models can match or outperform the CVaR teacher and achieve improved robustness under regime shifts.

Framework corrects model form errors in structural dynamics predictions.

problem Model form errors in parametric models of structural dynamics.
method Gaussian Process Latent Force Model (GPLFM) for non-parametric discrepancy representation, linear Bayesian filtering for state and discrepancy estimation, modal reduction for computational tractability.
result Significant reduction of displacement and rotation prediction errors under unseen excitations.

Optimizes power systems with energy storage under uncertainty using scenario-based method.

problem Optimizing power systems with energy storage, intermittent renewable generation, and uncontrollable loads under uncertainty.
method Developed a novel solution method based on scenario optimization and strategic sampling to solve the chance-constrained optimal power system operation problem.
result The strategic sampling method significantly improves computational efficiency and data-driven convex approximation of power flow.

Extracts intrinsic spatial coordinates for complex agent systems to learn PDEs.

problem Modeling collective dynamics of heterogeneous agents.
method Data-driven extraction of intrinsic spatial coordinates, learning PDEs in emergent space.
result Collective dynamics can be approximated through learned PDEs in emergent coordinates.

This paper uses bandit theory and Thompson Sampling to optimize protein sequences.

problem Optimizing protein sequences using machine learning and directed evolution.
method Proposes a Thompson Sampling-guided Directed Evolution (TS-DE) framework.
result TS-DE achieves a nearly optimal Bayesian regret of order ildeO(d2MT) ilde O(d^{2}\sqrt{MT}).

New algorithm uses machine learning to predict rewards for decision-making problems.

problem Sequential decision-making under uncertainty with scarce online data.
method Machine Learning-Assisted Upper Confidence Bound (MLA-UCB) algorithm.
result Proves to improve cumulative regret even with biased surrogate rewards.