New model estimates unknown number of users in asynchronous multiuser communication.
problem Estimating unknown number of users in asynchronous multiuser communication.
method Infinite factorial finite state machine model with Bayesian nonparametric approach.
result Effective recovery of data-generating process for various scenarios.
Method infers causal structure from system behaviors using RKHS and kernel ε-machines.
problem Discovering causal structure in systems with varying external and measurement noise.
method Combines causal states and RKHS for efficient representation and inference of causal structure.
result Robustly estimates causal structure in high-dimensional data with varying noise.
Epsilon-machines are minimal, unifilar presentations of stationary stochastic processes. They were originally defined in the history machine sense, as hidden Markov models whose states are the equivalence classes of infinite pasts with the same probability distribution over futures. In analyzing synchronization, though…
High-throughput 3D control training system achieves 100,000 FPS.
problem Lack of efficient, single-machine reinforcement learning systems.
method Sample Factory combines asynchronous sampling and off-policy correction.
result Achieves 100,000 FPS on 3D control problems without sacrificing sample efficiency.
New dataset for industrial machine sounds to aid maintenance.
problem Lack of public datasets for industrial machine sounds.
method Recorded normal and anomalous sounds of industrial machines.
result Assists in automated facility maintenance development.
Study optimizes CANN for actuarial tasks using RSM.
problem Optimizing hyperparameters for neural networks in actuarial science.
method Factorial design and response surface methodology (RSM).
result Reduced hyperparameter optimization from 288 to 188, achieving near-optimal performance.
Natural image statistics exhibit hierarchical dependencies across multiple scales. Representing such prior knowledge in non-factorial latent tree models can boost performance of image denoising, inpainting, deconvolution or reconstruction substantially, beyond standard factorial "sparse" methodology. We derive a large …
In this paper, we develop a parameter estimation method for factorially parametrized models such as Factorial Gaussian Mixture Model and Factorial Hidden Markov Model. Our contributions are two-fold. First, we show that the emission matrix of the standard Factorial Model is unidentifiable even if the true assignment ma…
Complex Chern-Simons theory reveals peacock patterns in perturbative series.
problem Understanding the structure of partition functions in complex Chern-Simons theory.
method Analyzing the partition function as a holomorphic function and using resurgence theory.
result Perturbative series are resurgent, with trans-series involving non-perturbative variables.
We study a novel spline-like basis, which we name the "falling factorial basis", bearing many similarities to the classic truncated power basis. The advantage of the falling factorial basis is that it enables rapid, linear-time computations in basis matrix multiplication and basis matrix inversion. The falling factoria…
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 work of Jørgensen and Thurston shows that there is a finite number N(v) of orientable hyperbolic 3-manifolds with any given volume v. In this paper, we construct examples showing that the number of hyperbolic knot complements with a given volume v can grow at least factorially fast with v. A similar statement holds…
New factorial power constants improve optimization convergence rates.
problem Optimization convergence rates depend on various constants.
method Proposes using factorial powers for defining these constants.
result Factorial powers simplify or improve convergence rates of optimization methods.
Bayesian neural networks improve uncertainty estimation in 3D point cloud segmentation for factory planning.
problem Improving uncertainty estimation in 3D point cloud segmentation for factory planning.
method Proposed fully Bayesian and approximate Bayesian neural networks for point cloud segmentation.
result Superior model performance and improved segmentation results with uncertainty incorporation.
We study local, global and local-to-global properties of threefolds with certain singularities. We prove criteria for these threefolds to be rational homology manifolds and conditions for threefolds to satisfy rational Poincaré duality. We relate the topological Euler characteristic of elliptic Calabi-Yau threefolds wi…
Factorial hidden Markov models (FHMMs) are powerful tools of modeling sequential data. Learning FHMMs yields a challenging simultaneous model selection issue, i.e., selecting the number of multiple Markov chains and the dimensionality of each chain. Our main contribution is to address this model selection issue by exte…
We determine the factorial growth rate of the number of finite index subgroups of right-angled Artin groups as a function of the index. This turns out to depend solely on the independence number of the defining graph. We also make a conjecture for right-angled Coxeter groups and prove that it holds in a limited setting…
The paper describes a cover of strata of k-differentials with a formula for fiber cardinality.
problem Understanding the ramification locus and cardinality of fibers in strata of k-differentials.
method Intersection calculations on multi-scale compactification and flat geometry.
result A formula for the cardinality of each fiber involving the k-factorial function.
Alexander's conjecture extended to infinite simplicial complexes.
problem Alexander's conjecture for infinite simplicial complexes.
method Generalization of recent result for finite simplicial complexes.
result Alexander's conjecture holds for infinite simplicial complexes.
Neural networks learn more efficiently with hidden factorial structures.
problem Challenges in high-dimensional statistical learning.
method Controlled experimental framework to test neural networks' ability to exploit hidden factorial structures.
result Neural networks can leverage hidden factorial structures to learn discrete distributions more efficiently.
Factorial moments are convenient tools in nuclear physics to characterize the multiplicity distributions when phase-space resolution (Δ) becomes small. For uncorrelated particle production within Δ, Gaussian statistics holds and factorial moments Fq are equal to unity for all orders q. Correlations between par…
Paper adapts causal analysis for time-dependent systems, especially energy management.
problem Challenges in root-cause analysis for systems with lagged time-dependencies, particularly in energy management.
method Adapts causal root-cause analysis method to time-dependent systems, discusses two truncation approaches.
result Extension effectively localizes root-causes in feature and time domain with enough lags.
This work establishes the equivalence between neural networks and support vector machines.
problem Establishing the equivalence between neural networks and support vector machines.
method Proposed a method to establish the equivalence between infinitely wide neural networks trained by soft margin loss and standard soft margin SVMs with NTK trained by subgradient descent.
result The equivalence between NN and SVM is established, enabling practical applications such as non-vacuous generalization bounds and robustness certificates.
Designs efficient factorial experiments for product design under budget constraints.
problem Designing effective experiments for product design with limited traffic and overlapping experiments.
method Two-stage design: first stage samples and infers performance, second stage selects a final policy.
result The method outperforms one-shot tensor completion and unstructured best-arm benchmarks.
Proposes BSSP to stabilize predictions in biased data.
problem Distribution shift between training and test data causes prediction instability.
method Balance-subsampled stable prediction (BSSP) algorithm based on fractional factorial design.
result Significantly improves prediction stability across unknown test data.
New method uses Rashomon sets to improve Bayesian inference in factorial designs.
problem Combustion of model uncertainty in factorial designs leads to multimodal posterior and convergence issues.
method Rashomon-seeded annealing, integrating high-performing models as warm start for AIS.
result Restores full posterior inference without exhaustive enumeration of model space.
We introduce a Bayesian approach to discovering patterns in structurally complex processes. The proposed method of Bayesian Structural Inference (BSI) relies on a set of candidate unifilar HMM (uHMM) topologies for inference of process structure from a data series. We employ a recently developed exact enumeration of to…
New algorithms for high-dimensional HMMs reduce complexity by discarding non-local factors.
problem High-dimensional HMMs are computationally expensive to filter and smooth.
method Approximate filtering and smoothing via locality in factor graphs, avoiding exponential cost.
result Error bounds in local total variation norm are dimension-free, improving scalability.
In this work, we propose an infinite restricted Boltzmann machine~(RBM), whose maximum likelihood estimation~(MLE) corresponds to a constrained convex optimization. We consider the Frank-Wolfe algorithm to solve the program, which provides a sparse solution that can be interpreted as inserting a hidden unit at each ite…
Lectures on deep learning properties in infinite and large-width networks.
problem Understanding deep neural networks in extreme width conditions.
method Analysis of random deep neural networks, connections to linear models, kernels, and Gaussian processes, perturbative and non-perturbative treatments.
result Properties and behaviors of deep neural networks in the infinite-width limit and large-width regime.
New findings show single-treatment effects are unidentifiable in factorial experiments.
problem Identifying the effect of a single intervention in factorial experiments.
method Formalized sufficient conditions for the identifiability of single-treatment effects and developed nonparametric sharp bounds.
result Researchers must justify assumptions for extrapolating single-treatment effects.
Special covers of alternating links have finite index subgroups in certain groups.
problem Understanding the structure of alternating link complements and their subgroups.
method Constructing special covers with bounded degree and embedding into specific groups.
result Explicit bounds on the index of subgroups in right-angled Artin and Coxeter groups.
Unsupervised machine learning helps design complex experiments more efficiently.
problem Designing experiments with many factors and constraints is challenging and costly.
method Applied a beta variational autoencoder (beta-VAE) to represent trials in a low-dimensional latent space.
result Generated pragmatic designs with fewer trials while maintaining objectives.
The past decade has seen substantial work on the use of non-negative matrix factorization and its probabilistic counterparts for audio source separation. Although able to capture audio spectral structure well, these models neglect the non-stationarity and temporal dynamics that are important properties of audio. The re…
Proposes a new prior for deep generative models to capture latent properties.
problem Complex non-linear relationships between data and latent properties.
method Factorial mixture prior with Gaussian mixture models for quantization.
result Empirically evaluated method for learning discrete properties in unsupervised or semi-supervised settings.
Factorial moments are convenient tools in particle physics to characterize the multiplicity distributions when phase-space resolution (Δ) becomes small. They include all correlations within the system of particles and represent integral characteristics of any correlation between these particles. In this letter, we sh…
Existence of Kähler-Einstein metrics on toric varieties proven.
problem Existence of Kähler-Einstein metrics on toric varieties.
method Characterization of K-stability using log Cox ring and universal orbifold cover.
result Every Q-factorial normal projective toric variety allows an orbifold Kähler-Einstein metric.
Prediction Factory automates predictive model development and evaluation.
problem Rapidly developing and sharing predictive models with domain experts.
method Data science automation system with three interfaces: baseline, full, and optional automation.
result Full automation interface generated reports funded 57.5% of the time, compared to 42.5% for baseline.
Study of flip graphs and their automorphism groups for infinite-type surfaces.
problem Understanding automorphism groups of flip graphs for infinite-type surfaces.
method Examined the relationship between mapping class groups and flip graphs for infinite-type surfaces.
result Extended mapping class groups are isomorphic to proper subgroups of automorphism groups of flip graphs.
We prove the factoriality of the following nodal threefolds: a complete intersection of hypersurfaces F and G⊂P5 of degree n and k respectively, where G is smooth, ∣Sing(F∩G)∣⩽(n+k−2)(n−1)/5, n⩾k; a double cover of a smooth hypersurface $F\subset\mathbb{P}^{…
New method improves anomaly detection in acoustic signals.
problem Poor anomaly detection performance in existing acoustic signal-based unsupervised methods.
method Deep autoencoding Gaussian mixture model with hyper-parameter optimization.
result Significantly improved anomaly detection performance compared to previous methods.
This paper introduces the factorial marked temporal point process model and presents efficient learning methods. In conventional (multi-dimensional) marked temporal point process models, event is often encoded by a single discrete variable i.e. a marker. In this paper, we describe the factorial marked point processes w…
Generalized Stacey-Roberts lemma for Banach manifolds.
problem Constructing Lie groupoids of smooth mappings in infinite-dimensional geometry.
method Generalization of the Stacey-Roberts lemma to Banach manifolds with smooth partitions of unity.
result Remedied an error in the original proof for finite-dimensional setting.
New framework combines simple machines into complex ones for better neural network performance.
problem Improving neural network performance with limited training data.
method Developed a framework using topology and functional analysis to combine simple machines into complex ones, and used kernel methods to find optimal architectures.
result Kernel-inspired networks can outperform classical neural networks when training data is small.
NoMoPy models noise as HMM/FHMM in Python.
problem Modeling noise in data.
method Approximate and exact EM algorithms, cross-validation, confidence region estimation.
result Validated on example problems.
Empirical study compares wide neural networks to kernel methods, resolving open questions.
problem Understanding the relationship between wide neural networks and kernel methods.
method Large-scale empirical study using various neural network architectures and kernel methods.
result Wide neural networks outperform fully-connected finite-width networks in some cases, but underperform convolutional finite-width networks.
We investigate the statistical complexity of estimating the parameters of a discrete-state Markov chain kernel from a single long sequence of state observations. In the finite case, we characterize (modulo logarithmic factors) the minimax sample complexity of estimation with respect to the operator infinity norm, while…
Factorial Hidden Markov Models (FHMMs) are powerful models for sequential data but they do not scale well with long sequences. We propose a scalable inference and learning algorithm for FHMMs that draws on ideas from the stochastic variational inference, neural network and copula literatures. Unlike existing approaches…