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.

169,181 papers · 148 categories

Trend · papers per month

120240359479 · Jun 202019922001200920182026
48 results for τ-mixing process

Characterizes measures preserving compound mixed renewal process properties.

problem Preserving compound mixed renewal process properties under different probability measures.
method Characterization of progressively equivalent probability measures.
result Any compound mixed renewal process can be converted into a compound mixed Poisson process through a change of measures.

Study online learning in RKHS with dependent processes, focusing on \(β\)- and \(φ\)-mixing.

problem Online learning in RKHS with dependent data.
method Online regularized learning algorithm in RKHS, analyzing \(β\)- and \(φ\)-mixing sequences.
result Probabilistic upper bounds and convergence rates for mixing coefficients.

Paper reduces hyperparameters in mixed-categorical Gaussian processes for green aircraft optimization.

problem High-dimensional mixed-categorical Gaussian processes with many hyperparameters.
method Innovative dimension reduction algorithm using partial least squares regression.
result Significant reduction in fuel consumption (439 kg) for a green aircraft.

We study a special case of the problem of statistical learning without the i.i.d. assumption. Specifically, we suppose a learning method is presented with a sequence of data points, and required to make a prediction (e.g., a classification) for each one, and can then observe the loss incurred by this prediction. We go …

2015-12-26abs ↗pdf ↗

Simple algorithm gives optimal regret bounds for reinforcement learning.

problem Optimizing regret in reinforcement learning for Markov decision processes.
method Optimistic algorithm with regret bound analysis based on mixing time.
result First optimal regret bounds with ildeO(tmmixSAT) ilde{O}(\sqrt{t_{ m mix} SAT}) after TT steps.

The literature on statistical learning for time series assumes the asymptotic independence or ``mixing' of the data-generating process. These mixing assumptions are never tested, nor are there methods for estimating mixing rates from data. We give an estimator for the ββ-mixing rate based on a single stationary sample…

2011-03-04abs ↗pdf ↗

Bayesian optimization tackles mixed discrete-continuous problems with Gaussian processes.

problem Optimizing problems with both discrete and continuous variables using costly simulations.
method Relaxing discrete variables into continuous latent variables, using Bayesian optimization, and incorporating compatibility constraints with Lagrangians.
result Comparative analysis of different mixed Bayesian optimization approaches.

The paper explores how mixing and diffusion mechanisms can enhance privacy in data processing.

problem Enhancing privacy guarantees of data mechanisms through post-processing.
method The study uses Markov operators and coupling arguments to analyze privacy amplification.
result The introduction of a new family of diffusion-based mechanisms that are closed under post-processing.

Unsupervised ML method reveals hidden features in reactive-diffusion simulations.

problem Automating interpretation of large model outputs in reactive-diffusion simulations.
method NTFk using Non-negative Tensor Factorization (NTF) coupled with k-means clustering.
result Identifies additive features characterizing mixing behavior.

Bayesian optimization reduces hyperparameters for mixed variable design problems.

problem Optimizing designs with a large number of mixed continuous, integer, and categorical variables.
method Adaptive dimension reduction using partial least squares for fewer hyperparameters.
result Significant improvement in performance compared to genetic algorithms.

New algorithm learns optimal policy for average reward MDPs with sample complexity matching lower bound.

problem Learning optimal policy for average reward in uniformly ergodic MDPs.
method Developed an estimator with sample complexity of O(|S||A|t_{mix}ε^{-2}).
result First algorithm to match lower bound of existing literature.

A new data augmentation method selects mixed classes based on class distances for better performance.

problem Improving recognition accuracy in object recognition using deep learning.
method Calculates class distances and selects mixed data from suitable classes dynamically.
result Improves recognition performance on general and long-tailed image recognition datasets.

Study on gradient descent in Hilbert spaces with Markov chains, focusing on mixing coefficients.

problem Analyzing convergence of gradient descent in Hilbert spaces with stationary Markov chains.
method Examined strictly stationary Markov chains with φφ- and ββ-mixing coefficients, derived probabilistic upper bounds.
result Probabilistic upper bounds on convergence behavior of gradient descent algorithm based on mixing coefficients.

Adapts Bayesian optimization for mixed constraints in aircraft design.

problem Optimizing expensive black box functions with mixed constraints.
method Super efficient global optimization with upper trust bound for constraints, Gaussian process uncertainty, refinement procedure.
result Superior performance on aircraft design problem compared to state-of-the-art solvers.

Paper extends nonparametric regression bounds for dependent β\beta-mixing samples.

problem Analyzing error in nonparametric regression with dependent data.
method Extends uniform deviation inequalities from independent to dependent β\beta-mixing samples.
result Derives generalization bounds for nonparametric regression with dependent data.

GP-MRO discovers robust mixed strategies for unknown objectives.

problem Optimizing unknown objectives against worst-case uncertain parameters.
method Sequential learning from noisy point evaluations, combining online learning and Gaussian processes.
result GP-MRO finds robust mixed strategies that significantly improve performance over deterministic strategies.

Deep normative modeling of clinical neuroimaging data improves diagnostic performance.

problem Modeling variation of neuroimaging measures across individuals for psychiatric disorders.
method Proposes a deep normative modeling framework based on neural processes (NPs) for spatially structured mixed-effect modeling of neuroimaging data.
result Substantial improvements in novelty detection performance for certain diagnostic problems.

A hybrid model for Bayesian optimization handles mixed variables using MCTS for categorical and GP for continuous.

problem Optimizing functions with mixed variable types (continuous, integer, categorical).
method Merges MCTS for categorical and GP for continuous variables, integrates UCTS search strategy, and dynamically selects kernels.
result Hybrid models outperform traditional methods in Bayesian optimization.

Improves model predictability by mixing forecasts and orthogonalizing models.

problem Redundant models contaminate model space and degrade predictive performance.
method Principal Component Analysis for model orthogonalization in Bayesian forecast mixing.
result Better prediction accuracy and excellent uncertainty quantification.

The paper analyzes convergence rates of Langevin dynamics and Proximal Sampler using ΦΦ-divergence.

problem Analyzing convergence rates of Langevin dynamics and Proximal Sampler.
method Extending mixing time analyses to ΦΦ-divergence, using strong data processing inequalities.
result Convergence of ΦΦ-divergence to 0 exponentially fast along Unadjusted Langevin Algorithm and Proximal Sampler.

Research tackles novelty detection for mixed-type data, proposing probabilistic methods.

problem Detect anomalies in mixed-type datasets like numerical and categorical data.
method Experimental comparison of methods, probabilistic nonparametric model, autoencoder-based model.
result Developed robust methods for mixed-type data novelty detection.

Flexible non-stationary modeling of spatial outcomes using a mixed-stationary Gaussian process.

problem Limited flexibility in non-stationary models and computational intractability.
method Developed a non-stationary Gaussian process with individually set stationarity parameters at each location, using a non-parametric mixture model to reduce parameters and incorporate spatial correlation.
result Improved prediction efficiency through spatially correlated components in the mixture model.

Bayesian Optimization framework tackles materials design challenges with mixed variables.

problem Challenges in materials design due to mixed qualitative and quantitative variables, limited data, and high simulation costs.
method Data-centric, mixed-variable Bayesian Optimization framework using Latent Variable Gaussian Process (LVGP) and Expected Improvement acquisition function.
result Locates optimal design for insulating polymer nanocomposites efficiently.

Estimates mixing coefficients of geometrically ergodic Markov processes from a single sample path.

problem Estimating mixing coefficients of geometrically ergodic Markov processes.
method Proposes methods to estimate β\beta-mixing coefficients from a single sample path under standard smoothness conditions.
result Obtains a rate of convergence of order \(\mathcal{O}(\log(n) n^{-[s]/(2[s]+2)})\) for the expected error of the estimator.

WE constructs GP kernels for mixed inputs using weighted EDMs.

problem Limitation of standard GP models in handling categorical variables.
method WEGP constructs kernel function using weighted EDMs for categorical inputs.
result WEGP improves GP model accuracy in both synthetic and real-world optimization problems.

Bayesian optimization with binary auxiliary info for faster target function optimization.

problem Optimizing target functions with expensive binary auxiliary information.
method Mixed-type Gaussian process (MOGP) and information-based acquisition functions (MT-ES, MT-PES).
result Efficient approximation of mixed-type predictive ES via random features.

New method separates mixed distributions without requiring samples of each source.

problem Separating mixed distributions in machine learning and signal processing.
method Neural Egg Separation method iteratively learns to separate known from unknown distributions.
result Neural Egg Separation outperforms current methods in audio and image separation tasks.

A new method for Gaussian Processes handles mixed continuous and categorical inputs.

problem Modeling cross-correlations between continuous and categorical data.
method Low-Rank Correlation (LRC) method for Gaussian Processes with flexible rank approximation.
result LRC outperforms existing methods in estimating cross-correlations and predicting response surfaces.

We investigate the systematic mechanism for designing fast mixing Markov chain Monte Carlo algorithms to sample from discrete point processes under the Dobrushin uniqueness condition for Gibbs measures. Discrete point processes are defined as probability distributions μ(S)exp(βf(S))μ(S)\propto \exp(βf(S)) over all subsets $S\in 2^…

2015-06-06abs ↗pdf ↗

The paper studies convergence of kernel autocovariance operators for stationary processes.

problem Estimating autocovariance operators of stationary processes on Polish spaces.
method Investigates convergence of empirical estimates of autocovariance operators under various conditions.
result Provides consistency results for kernel PCA and spectral analysis methods.

We introduce a general framework of the Mixed-correlated ARFIMA (MC-ARFIMA) processes which allows for various specifications of univariate and bivariate long-term memory. Apart from a standard case when Hxy=12(Hx+Hy)H_{xy}={1}{2}(H_x+H_y), MC-ARFIMA also allows for processes with Hxy<12(Hx+Hy)H_{xy}<{1}{2}(H_x+H_y) but also for long-range …

2013-07-23abs ↗pdf ↗

Develops a deep learning framework for various data types.

problem Handling nonparametric regression and classification across different data types.
method Introduces a general framework with two estimators: NPDNN and SPDNN, based on data satisfying generalized Bernstein-type inequalities.
result Both NPDNN and SPDNN estimators are minimax optimal in many classical settings.

Particle MCMC involves using a particle filter within an MCMC algorithm. For inference of a model which involves an unobserved stochastic process, the standard implementation uses the particle filter to propose new values for the stochastic process, and MCMC moves to propose new values for the parameters. We show how p…

2014-08-29abs ↗pdf ↗