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

Trend · papers per month

6.3%12.6%18.9%25.2% · Jun 201919922001200920182026
48 results for mixed states

This paper reviews state-of-the-art mixed data clustering algorithms.

problem Clustering mixed data is challenging due to the difficulty in applying mathematical operations to feature values.
method Taxonomy and state-of-the-art review of mixed data clustering algorithms.
result Identification of five major research themes and analysis of strengths and weaknesses of methods.

New model clusters mixed-type data with missing values, improving air quality analysis.

problem Clustering mixed-type data with missing values and regime persistence.
method Statistical jump model incorporating regime persistence and handling missing data.
result Superior performance in inferring persistent air quality regimes compared to traditional methods.

Machine learning models accurately predict the state and dynamics of reactive mixing.

problem Accurate prediction of reactive mixing for Earth and environmental science applications.
method Built a high-fidelity numerical model to simulate reactive mixing scenarios. Used 20 different machine learning emulators to classify mixing state and predict three QoIs.
result Ensemble methods and MLP models accurately predict the state of reactive mixing and QoIs, significantly faster than high-fidelity simulations.

In this paper we propose a geometrization of the non-relativistic quantum mechanics for mixed states. Our geometric approach makes use of the Uhlmann's principal fibre bundle to describe the space of mixed states and as a novelty tool, to define a dynamic-dependent metric tensor on the principal manifold, such that the…

2013-02-06abs ↗pdf ↗

Researchers measure distances between quantum states to speed up machine learning.

problem Calculating distances between quantum states for machine learning is complex.
method Three-step method using many-particle interference to measure Hilbert-Schmidt distance.
result The method reduces complexity in calculating Euclidean distances between quantum states.

HMQ improves quantization for edge devices with mixed precision.

problem Efficient quantization for edge devices with uniform, power-of-two thresholds.
method Introduces HMQ, a mixed precision quantization block that repurposes Gumbel-Softmax for searching over quantization schemes.
result Achieves competitive and state-of-the-art results on ImageNet despite restrictions.

initKmix generates better initial partitions for k-means clustering of mixed datasets.

problem Random initial partitions lead to inconsistent clustering results.
method initKmix runs k-means multiple times, using different attributes to create initial clusters, then combines results.
result initKmix produces more accurate and consistent clustering results.

Estimates Markov chain parameters from a single long sequence, analyzing complexity based on mixing properties.

problem Estimating parameters of a discrete-state Markov chain kernel from a single long sequence of observations.
method Characterizes minimax sample complexity in finite and countably infinite cases, focusing on mixing properties.
result Sample complexity is governed by mixing properties, with finite-sample estimators available for finite-state cases.

We give a simple optimistic algorithm for which it is easy to derive regret bounds of O~(tmixSAT)\tilde{O}(\sqrt{t_{\rm mix} SAT}) after TT steps in uniformly ergodic Markov decision processes with SS states, AA actions, and mixing time parameter tmixt_{\rm mix}. These bounds are the first regret bounds in the general, non-epi…

2018-08-06abs ↗pdf ↗

New AMP algorithm estimates signals and latent variables in mixed regression models.

problem Estimating signals and latent variables in mixed regression models.
method Approximate Message Passing (AMP) algorithm for matrix GLM.
result State evolution recursion and optimal denoising functions for precise error minimization.

In this article we discuss some of the consequences of the mixed membership perspective on time series analysis. In its most abstract form, a mixed membership model aims to associate an individual entity with some set of attributes based on a collection of observed data. Although much of the literature on mixed members…

2013-09-13abs ↗pdf ↗

The paper explores knotoids, pseudo knotoids, braidoids, and pseudo braidoids on the torus.

problem The study of knotoids, pseudo knotoids, braidoids, and pseudo braidoids on the torus.
method Introducing new knotoid and braidoid concepts, isotopy theorems, state sum formulas, and Alexander and Markov theorems.
result Formulation and proof of Alexander and Markov theorems for mixed knotoids and mixed pseudo knotoids.

Many real-valued stochastic time-series are locally linear (Gassian), but globally non-linear. For example, the trajectory of a human hand gesture can be viewed as a linear dynamic system driven by a nonlinear dynamic system that represents muscle actions. We present a mixed-state dynamic graphical model in which a hid…

2013-01-23abs ↗pdf ↗

Batchboost stabilizes training by mixing and pairing samples, improving accuracy.

problem Stabilizing training in machine learning, especially avoiding overfitting and underfitting.
method Batchboost pipeline with three stages: pairing, mixing, and feeding. Mixing uses mixup technique.
result Batchboost achieves 0.5-3% better accuracy than mixup on CIFAR-10 & Fashion-MNIST.

QR-MIX models joint state-action values as a distribution to handle randomness in MARL.

problem Randomness in rewards and observations leads to randomness in long-term returns in MARL.
method QR-MIX uses quantile regression and combines it with QMIX and IQN to model joint state-action values as a distribution.
result QR-MIX outperforms QMIX in the StarCraft Multi-Agent Challenge (SMAC) environment.

Estimates mixing time of non-reversible Markov chains from a single trajectory.

problem Estimating mixing time of non-reversible Markov chains from a single trajectory.
method Estimates pseudo-spectral gap instead of spectral gap, achieving polynomial dependence on minimal stationary probability and pseudo-spectral gap.
result Achieves polynomial dependence on minimal stationary probability and pseudo-spectral gap, overcoming the loss of symmetry.

MVRSM optimizes expensive functions with mixed variables, outperforming state-of-the-art methods.

problem Minimizing expensive functions with mixed continuous and integer variables.
method Mixed-Variable ReLU-based Surrogate Modelling (MVRSM) using rectified linear units.
result MVRSM outperforms state-of-the-art methods on synthetic and real-life benchmarks.

Unified framework for solving MDPs with stochastic mirror descent.

problem Approximately solving infinite-horizon Markov decision processes (MDPs).
method Primal-dual stochastic mirror descent for MDPs with a unified framework.
result Computes ε-optimal policies with expected samples for both average-reward and discounted MDPs.

A new method generates mixed-type features in tabular data with improved realism and accuracy.

problem Generating mixed-type features combining discrete and continuous data is challenging.
method A cascaded approach: first generates low-resolution categorical and coarse numerical features, then uses these in a high-resolution flow matching model.
result The model significantly improves detection scores, generating more realistic samples and capturing distributional details.

Paper tackles offline RL from mixed datasets with adaptive KL regularizer.

problem Challenges in optimizing RL and BC signals with varying action coverage and multiple action modes.
method Adaptively weighted reverse KL divergence regularizer based on TD3 algorithm.
result Empirically outperforms existing offline RL algorithms in MuJoCo locomotion tasks.

Unified approach tackles logical constraints in mixed-integer optimization.

problem Logical constraints in mixed-integer optimization problems.
method Express logical constraints non-linearly, reformulate as convex binary optimization, solve using outer-approximation.
result Solves problems faster and at larger scale than existing methods.

MOCA-HESP optimizes high-dimensional combinatorial and mixed spaces using hyper-ellipsoid partitioning.

problem Challenges in optimizing high-dimensional, combinatorial and mixed spaces.
method MOCA-HESP uses hyper-ellipsoid space partitioning with different categorical encoders and multi-armed bandit for adaptive selection.
result MOCA-HESP outperforms existing methods on various synthetic and real-world benchmarks.

Paper proposes a new approach for agents to explore environments efficiently.

problem Learning policies that explore uniformly and mix quickly in environments without external rewards.
method Introduces a surrogate objective to maximize entropy and develops a model-based reinforcement learning algorithm, IDE3^{3}AL.
result Demonstrates improved exploration and mixing in hard-exploration tasks.

Improved Metropolized HMC mixing time with multi-step gradients.

problem Improving the efficiency of sampling from complex probability distributions.
method Analyzing Metropolized HMC with multi-step integrators and applying sharpening techniques.
result Non-asymptotic upper bound on mixing time for Metropolized HMC with explicit step-size and leapfrog steps.

Improved state estimation in nonlinear models using amortized backward variational inference.

problem State estimation in general state-space models.
method Amortized backward variational inference with neural network parameters.
result Linear growth of variational approximation error in number of observations.

Scientific explanation often requires inferring maximally predictive features from a given data set. Unfortunately, the collection of minimal maximally predictive features for most stochastic processes is uncountably infinite. In such cases, one compromises and instead seeks nearly maximally predictive features. Here, …

2017-02-27abs ↗pdf ↗

A quantum state generation method that respects physical constraints.

problem Generating quantum states with complex-valued Hermitian, positive semi-definite, and trace one properties.
method Mirror diffusion model with von Neumann entropy to enforce structural constraints.
result Demonstrated effective generation of quantum states with conditional guidance.