Study shows most hyperbolic knot complements lack hidden symmetries.
problem Proving most knot complements lack hidden symmetries.
method Using rational functions on varieties associated to a link.
result Most knot complements lack hidden symmetries.
A new theory explains large associative memory with biological plausibility.
problem Large associative memory in neurobiology and machine learning.
method Microscopic theory with hidden neurons and two-body interactions.
result Valid model of large associative memory with biological plausibility.
Study spectral settings of generalized Laplacians on homogeneous spaces.
problem Understanding the spectral properties of generalized Laplacians on compact homogeneous spaces.
method Investigates the generic spectral configuration of operators on G-invariant metrics on M=G/K. result The spectral setting depends on G-isometries and hidden symmetries. 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.
CCA helps find hidden connections in complex biomedical data.
problem Analyzing large, multi-variable datasets in biology and medicine.
method Canonical correlation analysis (CCA) for exploring relationships between two sets of variables.
result CCA uncovers essential hidden associations between diverse data types.
New findings on hidden symmetries in ReLU networks.
problem Understanding the redundancy and symmetries in ReLU network parameter space.
method Analyzing parameter settings and function classes for various network architectures.
result For certain network architectures, there are no hidden symmetries.
ELMs benefit from using equal number of hidden nodes to training samples.
problem Overfitting and underfitting in ELMs with hidden nodes.
method ELMs with hidden nodes equal to training samples achieve perfect training.
result ELMs with larger hidden nodes outperform traditional ELMs.
New method models unknown systems with hidden parameters using neural networks.
problem Modeling unknown dynamical systems with hidden parameters.
method Training a deep neural network (DNN) model using trajectory data of the unknown system.
result DNN model accurately predicts unknown dynamical systems with new initial conditions.
This paper continues our exploration of homology cobordism of 3-manifolds using our recent results on Cheeger-Gromov rho-invariants associated to amenable representations. We introduce a new type of torsion in 3-manifold groups we call hidden torsion, and an algebraic approximation we call local hidden torsion. We cons…
A new clustering method learns shared hidden space and fuzzy partition between multi-view data.
problem Effective exploitation of relationship between different views in multi-view data.
method Hidden space sharing multi-view fuzzy clustering (HSS-MVFC) method based on fuzzy c-means.
result The proposed method outperforms many related clustering methods in experiments.
Consider a finite connected graph possibly with multiple edges and loops. In discrete geometric analysis, Kotani and Sunada constructed the crystal associated to the graph as a standard realization of the maximal abelian covering of the graph. As an application of what the author showed in an earlier paper with Seshadr…
The generic identification problem is to decide whether a stochastic process (Xt) is a hidden Markov process and if yes to infer its parameters for all but a subset of parametrizations that form a lower-dimensional subvariety in parameter space. Partial answers so far available depend on extra assumptions on the pro…
This work speeds up fHMM analysis by tensor algebra.
problem Scalability issues in analyzing factorial hidden Markov models.
method Tensorized algorithms and scalable filtering methods.
result Significant improvement in computational performance.
The paper optimizes portfolios in a market with hidden drift and random expert opinions.
problem Optimizing portfolios in a market with hidden Gaussian drift and random expert signals.
method Modeling the hidden drift using Kalman filters and solving the utility maximization problem with dynamic programming.
result Derivation of optimal portfolio weights and utility maximization under the given market conditions.
This paper unifies observability notions for colored graphs and identifies graph modifications to improve observability.
problem Observability of colored graphs and its relationship to graph properties.
method Unified framework of observability notions, graph modifications, and NP-completeness results.
result Identification of graph modifications to improve observability and NP-completeness of one modification problem.
A model of associative memory is studied, which stores and reliably retrieves many more patterns than the number of neurons in the network. We propose a simple duality between this dense associative memory and neural networks commonly used in deep learning. On the associative memory side of this duality, a family of mo…
New methods for estimating causal effects in hidden variable DAGs.
problem Estimating causal effects in models with hidden variables.
method Influence function based estimators for causal effects in hidden variable DAGs.
result Achieves semiparametric efficiency bounds for identifiable effects.
Study on hidden symmetries in Dehn fillings of tetrahedral links.
problem Existence of infinite families of knot complements with hidden symmetries.
method Analysis of horoball packings and SnapPy algorithm.
result No infinite families of knot complements with hidden symmetries exist for given tetrahedral links and related manifolds.
GenHMM combines neural networks with HMM for sequential data modeling.
problem Sequential data modeling challenges.
method Integrates neural network generative models into HMM framework.
result GenHMM improves likelihood computation and tractability.
Deep Convolutional Neural Networks (CNN) enforces supervised information only at the output layer, and hidden layers are trained by back propagating the prediction error from the output layer without explicit supervision. We propose a supervised feature learning approach, Label Consistent Neural Network, which enforces…
The paper parallelizes HMM inference for efficient long-term computations.
problem Efficiently computing inference in long-term hidden Markov models.
method Parallelization using associative elements and operators for sum-product and max-product algorithms.
result The proposed parallel algorithms are computationally efficient for long time horizons.
We introduce a new paradigm that is important for community detection in the realm of network analysis. Networks contain a set of strong, dominant communities, which interfere with the detection of weak, natural community structure. When most of the members of the weak communities also belong to stronger communities, t…
Estimates CATE under hidden confounding, accounting for bias and ignorance.
problem Learning CATE from high-dimensional data with unobserved confounders introduces bias and ignorance.
method Parametric interval estimator that accounts for hidden confounding and underrepresented samples.
result Estimator converges to tight bounds on CATE when there may be unobserved confounding.
DAG models with hidden variables present many difficulties that are not present when all nodes are observed. In particular, fully observed DAG models are identified and correspond to well-defined sets ofdistributions, whereas this is not true if nodes are unobserved. Inthis paper we characterize exactly the set of dist…
This study examines how hidden layers affect CNN performance on handwritten digit recognition.
problem Impact of hidden layers on CNN performance in handwritten digit recognition.
method Applied CNN with varying hidden layers on MNIST dataset, trained with stochastic gradient and backpropagation, tested with feedforward.
result Variations in accuracies for different hidden layers and epochs.
UNMIX identifies hidden buyers in darknet markets by clustering anonymized IDs.
problem Identifying hidden buyers in darknet markets where IDs are anonymized.
method UNMIX, a hidden buyer identification model using Dirichlet Hawkes Process.
result UNMIX successfully groups transactions from one hidden buyer into one cluster.
Improved MCMC for rare events in hidden Markov models.
problem Slow inference and prediction for rare latent states in hidden Markov models.
method Targeted sub-sampling (TASS) over-samples rare latent states, reducing variance in gradient estimation.
result Substantial gains in predictive and inferential accuracy on real and synthetic examples.
A Python package for GLHMM, a flexible HMM framework.
problem Handling diverse HMM applications in neuroscience.
method Stochastic variational inference for large datasets.
result Enables statistical testing and out-of-sample prediction.
Spectral deconfounding improves machine learning models by reducing hidden confounding effects.
problem Machine learning models can be misled by hidden confounders, leading to unreliable predictions.
method Develops a nonlinear spectral deconfounding framework for gradient boosting that modifies boosting dynamics to slow down in confounding-aligned directions.
result Spectrally deconfounded boosting improves estimation of the target function under hidden confounding and is more scalable.
New method disentangles hidden data structures using HSIC and supervision.
problem Tackles the challenge of interpreting high-dimensional data.
method Supervised Independent Subspace Principal Component Analysis (sisPCA) using HSIC.
result Identifies and separates hidden data structures effectively.
New findings on computational limits for estimating hidden structures.
problem Estimating hidden structures in noisy data.
method Use of low-degree polynomials as a restricted model of computation.
result Established low-degree hardness of recovery problems for easy detection problems.
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.
This paper deals with the binary classification task when the target class has the lower probability of occurrence. In such situation, it is not possible to build a powerful classifier by using standard methods such as logistic regression, classification tree, discriminant analysis, etc. To overcome this short-coming o…
Study reveals hidden structure behind Racah matrices for twisted knots.
problem Understanding non-associativity in representation products of twisted knots.
method Analysis of quantum R-matrices and their eigenvalues to decompose Racah matrices.
result Discovery of pentad structure (Tˉ,Sˉ,S,E,B) associated with universal R-matrix. New framework improves robust inference in HMMs under model misspecification.
problem Inference in general state-space HMMs under likelihood misspecification.
method Generalized Bayesian Inference (GBI) and Sequential Monte Carlo (SMC) methods.
result Improved performance in object tracking and Gaussian process regression.
Improves memory robustness in RNNs for sequential data.
problem Improving memory robustness in RNNs for sequential data processing.
method Utilized various training protocols, datasets, and architectures to analyze hidden state dynamics and propose a regularization technique.
result Manipulating hidden state speeds improves memory robustness over time.
This paper introduces a new approach to finding knots and links with hidden symmetries using "hidden extensions", a class of hidden symmetries defined here. We exhibit a family of tangle complements in the ball whose boundaries have symmetries with hidden extensions, then we further extend these to hidden symmetries of…
Uniform scaling limits in AdamW-trained transformers converge to ODEs.
problem Understanding the dynamics of large-depth transformers trained with AdamW.
method Modeling transformer dynamics as an interacting particle system coupled through attention, proving convergence to ODEs.
result The joint dynamics of hidden states and backpropagated variables converge uniformly to an ODE system.
New model accounts for sequential dependence in LLM reliability.
problem Uncertainty in LLM reliability assessment due to sequential interactions.
method Extended Bayesian framework with Hidden Markov Model for sequential dependence.
result Ignoring sequential dependence leads to overconfident reliability estimates.
This paper reveals hidden hyperbolic structures in divide links.
problem Understanding hyperbolic structures in divide links.
method Analyzing the complement of link of a divide using ideal polyhedra.
result Upper bound on hyperbolic volume of links of divides, asymptotically sharp.
Detects anomalies and locates their causes in large, high-dimensional data.
problem Locating hidden issues in complex systems with high-dimensional data.
method Copula-based model for multivariate probability distributions.
result Can identify and localize anomalies in large, high-dimensional data.
A test for neural networks identifies genetic associations.
problem Testing complex associations in neural networks.
method Sieve quasi-likelihood ratio test for neural networks with one hidden layer.
result The test statistic has an asymptotic chi-squared distribution.
For most problems in science and engineering we can obtain data sets that describe the observed system from various perspectives and record the behavior of its individual components. Heterogeneous data sets can be collectively mined by data fusion. Fusion can focus on a specific target relation and exploit directly ass…
Estimates crypto risk premia using hidden factors and finds significant integration with traditional markets.
problem Estimating risk premia in cryptocurrency returns.
method Giglio-Xiu (2021) three-pass approach, controlling for latent factors and non-tradable state variables.
result Latent factors significantly impact crypto returns, highlighting the importance of controlling for unobserved risks.
New HMC method handles features in POS tagging, outperforming MEMM.
problem HMC struggles with arbitrary features in POS tagging.
method Introduced Entropic Forward-Backward (EFB) probabilities to compute HMC restorations.
result EFB-based HMC outperforms MEMM in POS tagging.
Given a trivalent graph in the 3-dimensional Euclidean space, we call it a discrete surface because it has a tangent space at each vertex determined by its neighbor vertices. To abstract a continuum object hidden in the discrete surface, we introduce a subdivision method by applying the Goldberg-Coxeter subdivision and…
A new method for few-sample FS using manifold learning.
problem Few-sample supervised feature selection in high-dimensional spaces.
method Learn feature associations on manifolds, compute composite kernel, and use spectral analysis for FS score.
result Our method outperforms competitors in feature selection and classification accuracy.
The study uses DCC for financial market analysis, revealing hidden correlations.
problem Identifying hidden nonlinear correlations in financial markets.
method Agglomerative hierarchical clustering with distance correlation coefficient.
result DCC reveals more information than Pearson correlation for financial data.