This paper generalizes two facts about oriented 3d TFTs to the unoriented case. On one hand, it is known that oriented 3d TFTs having a topological boundary condition admit a state-sum construction known as the Turaev-Viro construction. This is related to the string-net construction of fermionic phases of matter. We sh…
Spin TFTs created by gauging line defects in 3D.
problem Creating spin TFTs from oriented TFTs with framed line defects.
method Constructing a spin TFT from an oriented TFT with framed line defects and a commutative Frobenius algebra.
result Spin TFTs extend earlier classifications and reproduce abelian spin Chern-Simons theories.
Adaptive TFTs improve cryptocurrency price prediction accuracy.
problem Precise short-term price prediction in volatile cryptocurrency markets.
method Dynamic subseries lengths and pattern-based categorization.
result Significantly outperforms baseline models in prediction accuracy and profitability.
Multi-horizon forecasting problems often contain a complex mix of inputs -- including static (i.e. time-invariant) covariates, known future inputs, and other exogenous time series that are only observed historically -- without any prior information on how they interact with the target. While several deep learning model…
Automates fitting semiconductor device models using approximate Bayesian computation.
problem Manual tuning of parameters for fitting TFT models to experimental data is inefficient and prone to errors.
method Approximate Bayesian Computation (aBc) for generating posterior distributions of estimated parameters.
result The proposed method accurately predicts model parameters from mobility curves using gradient boosted trees.
Graph coloring is explained using a topological field theory with defects.
problem Graph coloring as a combinatorial problem is quantum in nature.
method Topological field theory with defects to interpret graph coloring.
result Graph coloring is related to sections of a certain bundle.
A modular functor is constructed from non-semisimple 3d TFTs.
problem Constructing modular functors from non-semisimple 3d topological field theories.
method Using a 3d TFT defined in [arXiv:1912.02063], a symmetric monoidal 2-functor is constructed from a 2-category of bordisms to a 2-category of finite linear categories.
result A modular functor is explicitly described as a symmetric monoidal 2-functor.
This is an introductory review of topological field theories (TFTs) called AKSZ sigma models. The AKSZ construction is a mathematical formulation for the construction and analyses of a large class of TFTs, inspired by the Batalin-Vilkovisky formalism of gauge theories. We begin by considering a simple two-dimensional t…
We introduce and study the Wilson loops in a general 3D topological field theories (TFTs), and show that the expectation value of Wilson loops also gives knot invariants as in Chern-Simons theory. We study the TFTs within the Batalin-Vilkovisky (BV) and Alexandrov-Kontsevich-Schwarz-Zaboronsky (AKSZ) framework, and the…
CityTFT models urban building energy using a data-driven approach.
problem Current UBEM methods are time-consuming and based on physics.
method CityTFT uses a TFT framework with an augmented loss function.
result CityTFT predicts energy demands with high accuracy.
Hybrid model improves geopolitical conflict forecasting.
problem Forecasting geopolitical events from sparse, bursty data.
method Sparse Temporal Fusion Transformer (TFT) + Variational Nearest Neighbor Gaussian Process (VNNGP).
result Consistently outperforms standalone TFT in long-range horizons.
STS clarifies chaos and stochastic dynamics, linking algebraic topology and physics.
problem Chaos and stochastic dynamics in arbitrary form SDEs.
method Supersymmetric theory of stochastic dynamics (STS) using generalized transfer operator (GTO) and topological field theories (TFT).
result Positive 'pressure' in GTOs corresponds to spontaneous breakdown of topological supersymmetry, explaining 1/f noise.
Open 2D TFTs extend to closed theories with circle value as Hochschild homology.
problem Extending open 2D TFTs to closed theories.
method Using symmetric monoidal ∞-categories and Hochschild homology.
result Open 2D TFTs admit initial open-closed extensions.
We construct a gauge fixed action for topological membranes on G2-manifold such that its bosonic part is the standard membrane theory in a particular gauge. We prove that quantum mechanically the path-integral in this gauge localizes on associative submanifolds. Moreover on M×S1 the theory naturally reduces…
We propose a method to assign non-unitary TQFTs to certain SCFTs, deriving bounds and examples.
problem Assigning non-unitary TQFTs to specific SCFTs of rank 0.
method Using degenerate limits of SCFTs, extracting modular data from supersymmetric partition functions, and proposing a dictionary.
result Deriving a lower bound on the free energy of SCFTs and showing it is saturated by a specific SCFT.
Paper proposes a method for weather-informed probabilistic forecasting and scenario generation in power systems.
problem Challenges of integrating renewable energy sources into power grids due to their stochasticity and uncertainty.
method Combines probabilistic forecasting and Gaussian copula for day-ahead prediction and scenario generation of load, wind, and solar power.
result Demonstrates superior performance of the proposed weather-informed Temporal Fusion Transformer (WI-TFT) model.
NAS for financial time series forecasts using chain-structured architectures.
problem Optimizing neural architectures for financial time series forecasting.
method Comparison of three NAS strategies (Bayesian optimization, hyperband, reinforcement learning) on chain-structured search spaces for simple and complex architectures.
result Bayesian optimization and hyperband outperform other strategies, and RNN and 1D CNN perform best among architectures.
The paper presents new algebraic structures on the 2-sphere using topological field theories.
problem Understanding algebraic structures on the 2-sphere through topological field theories.
method Defined P-monoids and L-monoids, analyzed their properties, and related them to 3-dimensional topological field theories.
result New algebraic structures (P-monoids and L-monoids) on the 2-sphere are equivalent and have strong constraints.
The paper introduces BCART models for aggregate claim amount, improving frequency-severity and joint modeling.
problem Modeling aggregate claim amount with frequency-severity and joint dependencies.
method Developed three types of BCART models: frequency-severity, sequential, and joint models. Used various distributions for claim severity data.
result Weibull distribution outperforms gamma and lognormal for right-skewed, heavy-tailed claim severity data.
The paper uses model-based trees to create interpretable surrogate models for complex machine learning models.
problem Interpreting complex machine learning models.
method Using model-based trees to partition feature space and create interpretable models.
result Model-based trees generate optimal surrogate models that balance interpretability and performance.
Gauge Flow Models use a learnable Gauge Field in Generative Flow Models.
problem Improving generative model performance.
method Integrates a learnable Gauge Field into Flow ODEs.
result Gauge Flow Models outperform traditional Flow Models in Flow Matching experiments.
The study examines how model predictions hold up under model extensions.
problem Model predictions may not be robust under model extensions, limiting their applicability.
method The study uses causal ordering to assess robustness of qualitative model predictions and characterizes model extensions that preserve predictions.
result Conditions and techniques are provided to assess robustness of model predictions under model extensions.
Revises Bayesian model averaging for foundation models.
problem Ensemble pre-trained and lightly-finetuned foundation models for improved classification performance.
method Introduces trainable linear classifiers and computationally cheaper model averaging scheme (OMA).
result Ensembled models can better predict on various datasets.
Paper introduces symmetric divergence link models for probability distributions.
problem Symmetric divergence measures for probability distributions.
method Two general classes of link models: one for survival functions and another for cumulative probability distribution functions.
result Advantages of symmetric divergence measures over asymmetric measures for model averaging and feature assessment.
New method to handle credit portfolio model uncertainties.
problem Model risk in credit portfolio models.
method Demonstrates comprehensive yet easy-to-implement approach to uncertainty in model parameters.
result Comprehensive method to deal with model uncertainties.
The paper tests stock return models and uses LSTM to predict stock returns.
problem Validating stock return models and predicting stock returns.
method Used Fama-French three-factor, four-factor, and five-factor models; also used LSTM model.
result Fama-French five-factor model shows better validity for stock returns.
Researchers review challenges in interpreting additive models, especially neural additive models.
problem Challenges in interpreting additive models, particularly neural additive models.
method Review of generalized additive models and discussion of nonidentifiability.
result Challenges in claiming interpretability or suitability for safety-critical applications of additive models.
Novel hybrid modeling combines ML and physics for real-time diagnosis.
problem Real-time diagnosis of complex systems.
method Combines machine learning and physics-based models to create reduced-order models.
result Generated models are two orders of magnitude simpler, improving efficiency.
CRS model improves ranking data modeling with theoretical guarantees.
problem Lack of rich, multimodal models for ranking data.
method Contextual Repeated Selection (CRS) model for multimodal ranking data.
result CRS model significantly outperforms existing methods in various ranking contexts.
Sigma models linked to Gross-Neveu models via quiver varieties.
problem Understanding the relationship between sigma models and Gross-Neveu models.
method Exploring the mathematical correspondence between sigma models and Gross-Neveu models, including their geometric and trigonometric/elliptic deformations.
result Sigma models are mathematically equivalent to Gross-Neveu models under certain conditions.
Interpretable machine learning has become a strong competitor for traditional black-box models. However, the possible loss of the predictive performance for gaining interpretability is often inevitable, putting practitioners in a dilemma of choosing between high accuracy (black-box models) and interpretability (interpr…
Simple models are preferred over complex models, but over-simplistic models could lead to erroneous interpretations. The classical approach is to start with a simple model, whose shortcomings are assessed in residual-based model diagnostics. Eventually, one increases the complexity of this initial overly simple model a…
Matryoshka hides secret models in a carrier model, achieving high capacity and robustness.
problem Stealing functionality of private ML data by hiding models in a carrier model.
method Parameter sharing approach exploiting the learning capacity of the carrier model.
result Hides a 26x larger secret model or 8 secret models in the carrier model.
Seq2Seq models speed up epidemic model predictions.
problem Complex epidemic models are computationally expensive.
method Used deep seq2seq models as surrogates for complex models.
result Surrogates predict scenarios up to several thousand times faster.
This work develops scalable model selection methods with fast update and selection.
problem Efficient model selection for large pools of candidate models.
method Isolated model embedding, which supports asymptotically fast update and selection.
result Standardized Embedder achieves competitive model selection performances.
Paper proposes BMPO to optimize policies using bidirectional models.
problem Model-based reinforcement learning's reliance on forward model accuracy.
method Develops BMPO using both forward and backward models for policy optimization.
result BMPO outperforms state-of-the-art methods in sample efficiency and asymptotic performance.
Copulas outperform marginal models in multivariate risk forecasting, reducing model risk by narrowing down the set of models.
problem Model risk in multivariate risk forecasting, especially during crises.
method Comprehensive empirical study comparing Copula-GARCH models with fixed marginals, copulas, or neither.
result Model risk is almost entirely due to copula choice, not marginal models.
BayesBlend blends multiple models' predictions for better insurance loss predictions.
problem Improving insurance loss predictions by combining multiple models.
method Pseudo-Bayesian model averaging, stacking, and hierarchical stacking.
result BayesBlend provides a user-friendly way to blend model predictions and estimate weights.
The paper identifies when larger models improve predictions and proposes a switcher model.
problem Understanding when larger models benefit from added complexity.
method Numerical studies on T5 architecture to analyze predictive uncertainty and model performance.
result Large models improve on examples where small models are uncertain, but not on certain examples.
Improved diffusion model generation speed with speculative sampling.
problem Generating samples from computationally expensive diffusion models.
method Extending speculative sampling to diffusion models, using fast draft models for candidate token generation.
result Significant speedup in generation, halving the number of function evaluations.
We propose a generalization of neural network sequence models. Instead of predicting one symbol at a time, our multi-scale model makes predictions over multiple, potentially overlapping multi-symbol tokens. A variation of the byte-pair encoding (BPE) compression algorithm is used to learn the dictionary of tokens that …
The paper extends statistical inference methods for black-box generative models.
problem Understanding and validating black-box generative models without access to their internal data.
method Develops model-level statistical inference tasks using generative model representations.
result Model-level representations are effective for multiple inference tasks.
PMM uses Bayesian inference to generate data from noisy approximations.
problem Creating flexible generative models for various data types.
method Bayesian inference and conjugate pairs of distributions.
result PMM achieves performance competitive with existing generative models.
Unified model improves sampling speed and quality.
problem Difficult to balance sampling speed and quality.
method Multistep Consistency Models combining consistency and diffusion models.
result Improved sampling quality with reduced steps.
In science and especially in economics, agent-based modeling has become a widely used modeling approach. These models are often formulated as a large system of difference equations. In this study, we discuss two aspects, numerical modeling and the probabilistic description for two agent-based computational economic mar…
Driven by an increasing need for model interpretability, interpretable models have become strong competitors for black-box models in many real applications. In this paper, we propose a novel type of model where interpretable models compete and collaborate with black-box models. We present the Model-Agnostic Linear Comp…
Combining models in appropriate ways to achieve high performance is commonly seen in machine learning fields today. Although a large amount of combinatorial models have been created, little attention is drawn to the commons in different models and their connections. A general modelling technique is thus worth studying …
MaxEnt Model Correction improves reinforcement learning model accuracy.
problem Improving reinforcement learning model accuracy and convergence.
method MaxEnt Model Correction (MoCo) procedure to correct model's next-state distributions.
result MoCoVI and MoCoDyna algorithms converge faster and effectively use approximate models.