TOQ-Nets learn to recognize complex temporal events with varying objects and sequences.
problem Recognizing complex relational-temporal events with varying numbers of objects and sequence lengths.
method Neuro-symbolic networks with reasoning layers for finite-domain quantification over objects and time.
result TOQ-Nets can generalize to scenarios with more objects than training data and temporal warpings.
New estimates for Green's functions in varying Kähler metrics.
problem Uniform estimates for Green's functions in Kähler metrics.
method Broadening techniques to allow complex structure variation and removing assumptions.
result Uniform estimates for Green's functions in families of canonical Kähler metrics.
BASS efficiently learns time-varying graphs with low complexity and automatic tuning.
problem Estimating time-varying graphical models with efficient and automatic parameter tuning.
method BASS uses temporally-dependent spike-and-slab priors and variational inference to learn graph structures efficiently.
result BASS outperforms existing methods in recovering true graphs, especially for high-dimensional cases.
We investigate the linear stability of Kähler-Ricci solitons for perturbations induced by varying the complex structure within a fixed Kähler class. We calculate stability for the known examples of Kähler-Ricci solitons.
In this paper, we use Pacard-Xu's methods to discuss the complex deformation of constant scalar curvature metrics in the case of fixed and varying complex structures. Moreover, we also discuss the complex deformation of Kähler Ricci solitons.
Constructs complete Calabi-Yau metrics from smoothed Calabi-Yau intersections.
problem Creating complete Calabi-Yau metrics on non-compact manifolds.
method Extending Székelyhidi's work, constructing metrics with varying complex structures and possible singularities.
result Produces Calabi-Yau metrics with fibers having varying complex structures and possibly isolated singularities.
FaStR improves scalability for time-aware RS with varying coefficients.
problem Limited applicability of structured regression models to large-scale data with categorical effects and many interactions.
method Combines structured additive regression and factorization approaches in a neural network-based model implementation.
result FaStR scales better and performs competitively with other time-aware RS in prediction performance.
We give a proof of the Gromov compactness theorem using the language of stable curves (i.e. cusp-curve of Gromov, or stable maps of Kontsevich and Manin) in general setting: An almost complex structure on a target manifold is only continuous and can vary; the curves are only assumed to have fixed ``topological type'', …
Let K be a compact group. For a symplectic quotient Mλ of a compact Hamiltonian Kähler K-manifold, we show that the induced complex structure on Mλ is locally invariant when the parameter λ varies in Lie(K)∗. To prove such a result, we take two different approaches: (i) by using the complex geom…
We prove the convergence of Kähler-Ricci flow with some small initial curvature conditions. As applications, we discuss the convergence of Kähler-Ricci flow when the complex structure varies on a Kähler-Einstein manifold.
Method learns software resource usage from snapshots.
problem Challenges in learning time-varying, correlated resource usage.
method Graph structured Schrödinger bridge problem for nonparametric learning.
result Predicts most-likely resource distributions.
G-Net uses deep learning for complex counterfactual outcome prediction.
problem Estimating counterfactual outcomes under dynamic treatment strategies.
method G-Net is a sequential deep learning framework for G-computation.
result G-Net can handle complex temporal data and provide accurate treatment effects.
A fundamental object in a hyperbolic 3-manifold M is its convex core C(M), defined as the smallest closed non-empty convex subset of M. We investigate the way the geometry of the boundary S of C(M) varies as we vary the hyperbolic metric of M. Thurston observed that the intrinsic metric of S is hyperbolic, and that its…
GTMs model complex multivariate data with varying conditional independencies.
problem Modeling multivariate data with intricate marginals and complex dependency structures.
method Semiparametric approach using penalized splines and lasso regularization.
result GTMs accurately learn complex dependencies and identify conditional independencies.
Network models have been popular for modeling and representing complex relationships and dependencies between observed variables. When data comes from a dynamic stochastic process, a single static network model cannot adequately capture transient dependencies, such as, gene regulatory dependencies throughout a developm…
A new model predicts spatially varying inland flooding from time-varying inputs.
problem Ignoring time series and spatial correlations in flood models leads to inaccurate predictions.
method Introduced a multioutput Gaussian process model with separable kernels for functional inputs and spatial locations.
result The model provides accurate predictions of spatially varying inland flooding with minimal computational time.
New method learns time-varying home field advantage in football.
problem Discovering causal factors behind home field advantage in sports.
method DYNAMO: a novel causal discovery method for non-stationary processes.
result Time-varying home field advantages influenced by referee bias.
Paper discusses conditions for deforming coupled Kähler-Einstein metrics.
problem Conditions for deforming coupled Kähler-Einstein metrics.
method Analyzes deformation of coupled Kähler-Einstein metrics on Fano manifolds.
result Necessary and sufficient condition for deformation of coupled Kähler-Einstein metrics.
AJL framework detects dynamic patterns in high-dimensional time-varying models.
problem Complex time-varying associations and abrupt regime shifts in longitudinal processes.
method Hierarchical regularization framework integrating functional variable selection with structural changepoint detection.
result The refined estimator achieves the oracle property in ultra-high-dimensional settings.
Neural networks estimate time-varying parameters in AR(p) models with different noise types.
problem Forecasting time-dependent parameters in AR(p) processes with varying noise.
method Deep learning for time-varying coefficients, Gaussian and Laplace noise models.
result Simple model with time-varying parameters can effectively forecast complex dynamics.
CBNNs model survival with time-varying interactions, outperforming other methods.
problem Complex covariate effects and time-varying interactions in survival analysis.
method Combines case-base sampling with neural networks to model time-varying effects and complex baseline hazards.
result CBNNs outperform regression and neural network-based survival methods in simulations and real data applications.
Proposes a model to estimate treatment effects in complex multiagent systems over time.
problem Challenges in evaluating interventions in multiagent systems, especially with time-varying relationships and covariates.
method Interpretable counterfactual recurrent network leveraging graph variational recurrent neural networks and domain knowledge.
result Achieved lower estimation errors and more effective treatment timing than baselines in simulated and real-world scenarios.
Simplifies NL models by approximating them as LPV systems and identifying NL subterms.
problem Complex NL models are hard to interpret and impractical.
method Linear approximation around operating points, sparse estimation in RKHS, LPV model reduction.
result Identifies NL subterms and their input spaces in sparse additive NL models.
Estimates time-varying network connections using multi-stage smoothing.
problem Estimating edge probabilities of time-varying networks.
method Multi-stage smoothing: temporal local smoothing followed by node-domain smoothing.
result Captures both smooth temporal evolution and structural patterns in connectivity.
The paper generalizes the number of complex structures on metric Lie algebras.
problem How many orthogonal bi-invariant complex structures exist on metric Lie algebras?
method Developed a unique orthogonal decomposition into irreducible factors for metric Lie algebras.
result There are either 0 or 2^k such complex structures, with k the number of irreducible factors.
New method estimates causal effects with multi-valued, time-varying treatments.
problem Estimating causal effects with complex time-varying exposures.
method Combines machine learning and semiparametric efficiency theory.
result Proposes an efficient, asymptotically normal estimator for marginal structural models.
Proposes estimators for complex dose-response curves using kernel methods.
problem Estimating complex dose-response curves with continuous treatments, mediators, and covariates.
method Kernel ridge regression with sequential kernel embedding technique.
result Simple estimators for mediated and time-varying dose response curves with nonasymptotic uniform rates.
We develop a new statistical test for comparing variables with varying scales.
problem Comparing variables with different scales in multidimensional spaces.
method Order based on expectations of random variables, generalized stochastic dominance (GSD) order, regularized statistical test, linear optimization, imprecise probability models.
result Validated through multidimensional data from various fields.
KTVGL models tensor time series data for interpretable dynamic network estimation.
problem Estimating time-varying dependencies in multi-mode tensor time series data.
method Kronecker Time-Varying Graphical Lasso (KTVGL) for mode-specific dynamic network estimation.
result KTVGL produces interpretable modeling results and higher edge estimation accuracy than existing methods.
We examine how the most prevalent stochastic properties of key financial time series have been affected during the recent financial crises. In particular we focus on changes associated with the remarkable economic events of the last two decades in the mean and volatility dynamics, including the underlying volatility pe…
Paper formalizes a reinforcement learning model for complex information structures.
problem Complex interdependence in sequential decision-making problems.
method Formalizes a novel reinforcement learning model with explicit information structure representation.
result Upper bound on sample complexity of learning general sequential decision-making problems.
Method solves ∂ˉ-harmonic forms on Kodaira-Thurston manifold.
problem Finding ∂ˉ-harmonic forms on Kodaira-Thurston manifold. method Weil-Brezin transform, linear ODE systems, fundamental problem solving.
result Dimension of almost complex ∂ˉ-Hodge numbers can be arbitrarily large. Paper studies linear CMDPs, improving sample complexity for both models.
problem Improving sample complexity for linear CMDPs.
method Proposes novel model-based algorithms for two linear function approximation models.
result Guaranteed ε-suboptimality gap with desired polynomial sample complexity.
Develops a new multivariate regression model for complex outcomes.
problem Flexible, heterogeneous, and residual-dependent multivariate regression problems.
method MultiVCBART framework with Graphical Horseshoe priors.
result Empirically outperforms existing models on sparse, high-dimensional datasets.
New TVBO algorithm optimizes time-varying functions with varying sampling frequencies.
problem Optimizing time-varying, expensive, noisy functions with constant frequency assumption.
method Formulated practical recommendations and derived upper regret bound for varying sampling frequencies.
result BOLT algorithm outperforms state-of-the-art TVBO algorithms in experiments.
Abstract: Almost Kähler Hodge numbers vary with metric choices.
problem Variation of almost Kähler Hodge numbers with metrics.
method Analysis of almost complex Hodge numbers under different almost Kähler metrics.
result The almost Kähler Hodge number h0,1 varies with metric choices. We consider semi-direct products $\C^{n}\ltimes_φN$ of Lie groups with lattices Γ such that N are nilpotent Lie groups with left-invariant complex structures. We compute the Dolbeault cohomology of direct sums of holomorphic line bundles over G/Γ by using the Dolbeaut cohomology of the Lie algebras of the direct …
Efficient SGPRN model for imputation and visualization of missing data.
problem Imputation and visualization of missing data in time-varying correlation.
method Stochastic collapsed variational inference with structured Gaussian process regression network.
result Our model provides better imputation results on missing data than state-of-the-art methods.
Adaptive transfer learning model for varying mechanisms across domains.
problem Improving inference in a target domain by leveraging related source domains with varying mechanisms.
method Semi-parametric domain-varying coefficient model (DVCM) for structured transfer learning.
result Minimax rate-optimal adaptive transfer learning estimator with provable negative transfer safeguards.
Paper studies Kähler-Ricci flow convergence on Fano manifolds.
problem Uniform convergence of Kähler-Ricci flow on Fano manifolds.
method Analyzes flow behavior with varied initial metrics and complex structures.
result Proves uniqueness of Kähler-Ricci solitons in diffeomorphism orbits.
Adaptive ML learns complex time-varying systems without new data.
problem Applying ML to time-varying systems with shifting distributions.
method Mapping high-dimensional inputs to low-dimensional latent space, actively tuning latent space based on feedback.
result Learning correlations and tracking system evolution in real-time without new data.
New tool for summarizing time-varying data shapes.
problem Understanding dynamic data shapes.
method Introducing crocker stacks for time-varying metric spaces.
result Demonstrated utility in parameter identification task.
Paper proposes a method to model health outcomes using varying-coefficients and KNN-based LASSO.
problem Modeling health outcomes like BMI and cholesterol levels with varying age effects.
method Varying-coefficients regional quantile regression via KNN fused LASSO, with ADMM algorithm.
result Efficacy in capturing complex age-dependent associations between health outcomes and risk factors.
Deep belief networks are a powerful way to model complex probability distributions. However, learning the structure of a belief network, particularly one with hidden units, is difficult. The Indian buffet process has been used as a nonparametric Bayesian prior on the directed structure of a belief network with a single…
TNDE quantifies dynamic gene drivers from single-cell snapshots.
problem Reconstructing time-resolved regulatory effects in biological processes.
method Time-varying Network Driver Estimation (TNDE) using shared graph attention encoder and partial optimal transport.
result TNDE identifies stage-specific driver genes in mouse erythropoiesis.
A Deep Zero-Inflated Model for Detecting North Atlantic Right Whale Presence
problem Balancing marine conservation and blue economy management
method Deep Zero-Inflated Bernoulli model
result Improved model adequacy and predictive performance
Predicting the dependencies between observations from multiple time series is critical for applications such as anomaly detection, financial risk management, causal analysis, or demand forecasting. However, the computational and numerical difficulties of estimating time-varying and high-dimensional covariance matrices …
A new tree-based model for varying coefficients using CGBM.
problem Modeling varying coefficients with high dimensionality and complex interactions.
method Tree-based varying coefficient model with CGBM for varying coefficients, dimension-wise early stopping, and feature importance scores.
result The model produces comparable out-of-sample loss to neural networks, demonstrating effectiveness.