Paper tackles NAT translation issues with auxiliary regularization.
problem Improves NAT translation quality by addressing repeated and incomplete translations.
method Improves decoder hidden representations via two auxiliary regularization terms.
result Significant improvement in NAT model accuracy with better inference efficiency.
The study uses Bayesian Hidden Markov Models to predict cryptocurrency returns.
problem Predicting the volatility and trends of cryptocurrencies.
method Bayesian Hidden Markov Models with four states to capture different return characteristics.
result The NHHM model with four states outperforms other models in predicting cryptocurrency returns.
SWIFT learns intrinsic rewards from LLM hidden states for efficient best-of-N sampling.
problem Efficiency and scalability of reward models for LLMs.
method SWIFT (Simple Weighted Intrinsic Feedback Technique) learns a reward function directly from LLM hidden states.
result SWIFT outperforms existing baselines by 12.7% on MATH dataset while using less than 0.005% of their parameters.
Combining interpretability and stability methods improves DNN robustness.
problem Improving interpretability and robustness of deep neural networks.
method Combining interpretability (conductance) and stability (binary classifier) methods to detect and discard wrong predictions.
result Combining interpretability and stability methods increases model robustness.
Improves disease progression prediction using auxiliary surrogate labels and health markers.
problem Challenges in predicting disease progression due to unknown true disease states.
method Integrates hidden Markov model with time-varying discriminative classification model.
result Significant improvement in distinguishing LBD from AD using objective markers.
This paper enhances LSTM neural networks for multi-variable time series data, providing interpretable insights.
problem Accurate prediction of multi-variable time series data with interpretable insights.
method Variable-wise hidden states and a mixture attention mechanism to model the generative process of the target variable.
result Enhanced prediction performance by capturing the dynamics of different variables.
Hidden Markov Models classify cough events with high accuracy.
problem Identifying coughing events in noisy environments for health monitoring.
method Used Hidden Markov Models (HMMs) for cough classification.
result Multivariate HMMs achieved 92% AUR in classifying cough events.
Supervised learning frequently boils down to determining hidden and bright parameters in a parameterized hypothesis space based on finite input-output samples. The hidden parameters determine the attributions of hidden predictors or the nonlinear mechanism of an estimator, while the bright parameters characterize how h…
New insights into hidden minima in neural networks.
problem Identifying hidden minima in two-layer ReLU networks.
method Analyzing curves along which loss is minimized, focusing on eigenvalue contributions.
result Distinctive structural and symmetry properties of arcs emanating from hidden minima.
spex-LVM infers interpretable latent factors from biomedical data.
problem Inability to learn sparse and interpretable hidden states.
method Factorial latent variable model with sparse priors and domain-relevant annotations.
result Robustly identifies relevant structure in RNA-seq datasets.
TIMELY improves consistency in labeling blood cell images.
problem Inconsistent labeling of blood cells in microscopy images leads to unreliable diagnoses.
method TIMELY combines pseudotime inference and hidden Markov trees to correct labeling mistakes.
result TIMELY outperforms baseline methods in identifying and correcting inconsistent labels.
Expands Hidden Markov Model to include Markov chain observations.
problem Handling Markov chain observations in Hidden Markov Models.
method Developed Expectation-Maximization algorithm and Viterbi algorithm analogs.
result Estimates transition probabilities for hidden states and observations.
Detects anomalies in multiple processes using hidden Markov models.
problem Detecting an anomalous process among many with hidden states.
method Sequential search strategy using ADHM algorithm.
result ADHM algorithm effectively leverages temporal correlations.
Hidden stratification causes machine learning models to fail on rare but important patient subgroups.
problem Machine learning models fail on rare patient subgroups not identified during training or testing.
method Assessed techniques for measuring and describing hidden stratification effects on multiple medical imaging datasets.
result Evidence of hidden stratification leading to over 20% performance differences on clinically important subsets.
The paper introduces FMCI and hybrid decoding for hidden Markov models.
problem Computing distributions and decoding hidden state sequences in HMMs.
method Finite Markov chain imbedding (FMCI) and hybrid decoding.
result Hybrid decoding improves performance over traditional methods.
A novel RNN model with shuffled hidden states.
problem Improving recurrent neural network performance.
method Permuting hidden states and applying learned functions.
result Competitive results compared to literature baselines.
This paper tackles hidden state inference for HMMs using particle filtering.
problem Inference for hidden states under HMMs is challenging due to unavailable true labels.
method Adaptive conformal inference framework using particle filtering.
result The framework produces prediction sets with specific aggregated coverage levels.
Hybridizes LSTM and HMM for improved language model performance.
problem Improving the performance of LSTM and HMM models.
method Analyzes hidden state structures, compares predictive accuracy and hidden state output of LSTM and HMM.
result HMM can serve as an appropriate approximation of LSTM model.
Improves neural net generalization by modeling hidden state distribution.
problem Brittleness and failure of existing neural nets, especially with sparse labeled data and adversarial training.
method State reification: modeling hidden state distribution and projecting test states towards it.
result Helps neural nets generalize better, especially with sparse labeled data and adversarial training.
The paper characterizes brain states and transitions using functional MRI data.
problem Characterizing the dynamic reconfiguration of neural systems in brain states.
method Bayesian model-based characterization of latent brain states and posterior predictive discrepancy using the latent block model.
result The model detects transitions between latent brain states and identifies distinctive community patterns in task-fMRI data.
This paper advocates Riemannian multi-manifold modeling in the context of network-wide non-stationary time-series analysis. Time-series data, collected sequentially over time and across a network, yield features which are viewed as points in or close to a union of multiple submanifolds of a Riemannian manifold, and dis…
Pair Hidden Markov Models (PHMMs) are probabilistic models used for pairwise sequence alignment, a quintessential problem in bioinformatics. PHMMs include three types of hidden states: match, insertion and deletion. Most previous studies have used one or two hidden states for each PHMM state type. However, few studies …
Infinite Hidden Markov Models (iHMM's) are an attractive, nonparametric generalization of the classical Hidden Markov Model which can automatically infer the number of hidden states in the system. However, due to the infinite-dimensional nature of transition dynamics performing inference in the iHMM is difficult. In th…
The partially observable hidden Markov model is an extension of the hidden Markov Model in which the hidden state is conditioned on an independent Markov chain. This structure is motivated by the presence of discrete metadata, such as an event type, that may partially reveal the hidden state but itself emanates from a …
We search for digital biomarkers from Parkinson's Disease by observing approximate repetitive patterns matching hypothesized step and stride periodic cycles. These observations were modeled as a cycle of hidden states with randomness allowing deviation from a canonical pattern of transitions and emissions, under the hy…
Improved neural architecture search techniques fail to learn structural similarity.
problem NAS techniques fail to learn structural similarity.
method Investigated ENAS controller's hidden state and proposed a solution by training with a memory buffer.
result Models sampled from identical controller hidden states have no correlation with graph similarity metrics.
Direct approach for handling contextual bandits with latent state dynamics.
problem Handling contextual bandits with latent state dynamics, especially when rewards depend on posterior probabilities of hidden states.
method Direct reduction to standard linear contextual bandits, extended analysis of HMM parameters, periodic update of reward-model parameters.
result Periodic update of reward-model parameters allows handling complex dependencies in hidden states.
New method shows hidden state can significantly improve differential privacy in SGD.
problem Differential privacy in SGD with hidden state.
method Proves converging privacy bounds for hidden state SGD, using privacy amplification techniques.
result Privacy bound converges exponentially fast and is smaller than composition bounds.
Paper shows how to infer hidden states in neural networks analytically.
problem Intractability of Bayesian inference for neural networks.
method Leverage tractable approximate Gaussian inference (TAGI) for hidden states inference.
result Demonstrates inference of hidden states through constraints for various applications.
Reinforcement learning (RL) in Markov decision processes (MDPs) with large state spaces is a challenging problem. The performance of standard RL algorithms degrades drastically with the dimensionality of state space. However, in practice, these large MDPs typically incorporate a latent or hidden low-dimensional structu…
New method uses quandle rings to distinguish knots and their mirrors.
problem Distinguishing knots and their mirror images.
method Combining idempotents in quandle rings with state sum invariants.
result Improved knot and mirror image distinction using fewer quandles.
New MBL hidden Born machine learns various tasks.
problem Learning from quantum many-body systems.
method MBL dynamics and hidden units for training.
result Enhanced trainability and stability in learning.
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Detecting hidden variables poses two problems: determining the relations to other variables in the model and determining the number of states of …
Deep networks have achieved impressive results across a variety of important tasks. However a known weakness is a failure to perform well when evaluated on data which differ from the training distribution, even if these differences are very small, as is the case with adversarial examples. We propose Fortified Networks,…
Paper presents a fast method for estimating hidden states in Bayesian models.
problem Estimating hidden states in Bayesian state space models efficiently.
method Amortized simulation-based inference with pretraining.
result The method achieves sufficient accuracy and fast inference times.
Colored knot polynomials possess a peculiar Z-expansion in certain combinations of differentials, which depends on the representation. The coefficients of this expansion are functions of the three variables (A,q,t) and can be considered as new distinguished coordinates on the space of knot polynomials, analogous to the…
A new model captures diffusion dynamics in networks using hidden states.
problem Capturing temporal relationships and hidden content trajectories in network diffusion.
method A topological recurrent neural model that embeds diffusion history as hidden states.
result Good experimental performances for diffusion modeling and prediction.
This paper reviews recent advances in Bayesian nonparametric techniques for constructing and performing inference in infinite hidden Markov models. We focus on variants of Bayesian nonparametric hidden Markov models that enhance a posteriori state-persistence in particular. This paper also introduces a new Bayesian non…
CausalGame benchmarks LLM agents' causal thinking in games.
problem Evaluating causal thinking in AI Scientists with LLMs.
method Interactive games with 14 scenarios incorporating selection bias, measurement error, and hidden confounders.
result None of the 30 LLM agents demonstrated reliable causal thinking, with the best model achieving only 68.0% survival.
Study improves sample complexity for distinguishing continuous distributions and causal relationships.
problem Distinguishing continuous distributions and causal relationships in the presence of unobserved confounding.
method Proposed an estimator of KL divergence based on von Mises expansion for closeness testing.
result Established sample complexity guarantees for causal discovery in non-linear models with continuous variables and unobserved confounding.
We establish upper bounds for the minimal number of hidden units for which a binary stochastic feedforward network with sigmoid activation probabilities and a single hidden layer is a universal approximator of Markov kernels. We show that each possible probabilistic assignment of the states of n output units, given t…
Linear Dynamical System (LDS) is an elegant mathematical framework for modeling and learning multivariate time series. However, in general, it is difficult to set the dimension of its hidden state space. A small number of hidden states may not be able to model the complexities of a time series, while a large number of …
Price movements of stock market are not totally random. In fact, what drives the financial market and what pattern financial time series follows have long been the interest that attracts economists, mathematicians and most recently computer scientists [17]. This paper gives an idea about the trend analysis of stock mar…
Estimates dependent parameters using Markovian dependence with shrinkage.
problem Estimating dependent parameters from a hidden Markov model.
method Developed a novel non-parametric shrinkage algorithm combining Tweedie-based ideas and efficient state estimation.
result Superior performance compared to non-shrinkage methods in hidden Markov models.
Modified asymmetric hidden Markov models for time series with autoregressive components.
problem Dynamic relationships between variables in time series data.
method Introducing an asymmetric autoregressive component to recent asymmetric hidden Markov models.
result The model can choose the optimal autoregressive order for better likelihood.
New method infers hidden states in continuous-time phenomena better than traditional models.
problem Traditional HSMM's are limited to discrete time grids and cannot handle irregularly spaced data.
method Formulated integro-differential forward and backward equations for CTSMC's, introduced scalable Viterbi-type algorithm.
result Efficiently solved equations for posterior marginals and path estimates.
Bayesian method detects neuron spike activities from noisy fluorescence data.
problem Detecting neuron spike activities from noisy fluorescence data.
method Random finite set (RFS) based Bayesian approach.
result Gains 12% extra detection accuracy compared to MLSpike method.
Recurrent neural networks (RNNs) provide state-of-the-art performance in processing sequential data but are memory intensive to train, limiting the flexibility of RNN models which can be trained. Reversible RNNs---RNNs for which the hidden-to-hidden transition can be reversed---offer a path to reduce the memory require…