Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

1223 · Sep 202019922001200920172026
43 results for sub-models

We propose doubly nested network(DNNet) where all neurons represent their own sub-models that solve the same task. Every sub-model is nested both layer-wise and channel-wise. While nesting sub-models layer-wise is straight-forward with deep-supervision as proposed in \cite{xie2015holistically}, channel-wise nesting has…

2018-06-20abs ↗pdf ↗

DVERGE diversifies adversarial vulnerabilities to enhance robust ensemble models.

problem Diverse adversarial vulnerabilities for robust ensemble models.
method Isolates and diversifies adversarial vulnerabilities through distillation and training.
result Achieves higher robustness against transfer attacks compared to previous methods.

Fictitious play with reinforcement learning is a general and effective framework for zero-sum games. However, using the current deep neural network models, the implementation of fictitious play faces crucial challenges. Neural network model training employs gradient descent approaches to update all connection weights, …

2019-11-27abs ↗pdf ↗

Improves parallel deep model performance by restructuring and pruning.

problem Latency in parallel deep model execution due to interdependency among sub-models.
method Layer-wise model restructuring and pruning, using 0\ell_0 optimization and Munkres assignment algorithm.
result Significantly improves efficiency of distributed inference in terms of communication and computational complexity.

A new framework for efficient Bayesian network inference.

problem High-dimensional Bayesian networks are hard to infer due to computational scaling.
method Directed convex subgraphs and minimal d-decomposition tree for decomposition, enabling parallel computation.
result The method reduces computational cost and enables parallel computation.

Hidden regular variation is a sub-model of multivariate regular variation and facilitates accurate estimation of joint tail probabilities. We generalize the model of hidden regular variation to what we call hidden domain of attraction. We exhibit examples that illustrate the need for a more general model and discuss de…

2011-10-04abs ↗pdf ↗

Optimizes biomanufacturing processes with a new digital twin calibration method.

problem Lack of interpretability and sample efficiency in traditional DoE methods.
method Developed a computational approach to calibrate Bio-SoS digital twin model.
result Guides sample-efficient and interpretable DoEs by quantifying sub-model parameter estimation errors.

New methods for scalable inference in modular models with misspecified sub-models.

problem Model misspecification in multi-modular models complicates evidence combination.
method Variational methods for approximating Cut and SMI posteriors, and Variational Meta-Posterior.
result Feasibility of analysis with multiple cuts using a single set of variational parameters.

Word embeddings are a powerful approach for analyzing language and have been widely popular in numerous tasks in information retrieval and text mining. Training embeddings over huge corpora is computationally expensive because the input is typically sequentially processed and parameters are synchronously updated. Distr…

2018-12-07abs ↗pdf ↗

This paper introduces a deep learning ensemble forecasting model using Dirichlet process.

problem Forecasting with deep learning ensemble models.
method Infinite mixture model based on Dirichlet process, with decaying learning rate strategy.
result The ensemble model outperforms single benchmark models in prediction accuracy and stability.

Efficiently builds diverse sub-model ensembles for robust self-supervised learning.

problem Challenges in diversity and efficiency of deep ensembles for self-supervised representation learning.
method Ensemble of independent sub-networks with a new loss function for diversity.
result Significantly improves prediction reliability and model calibration.

We present a set of models relevant for predicting various aspects of intra-day trading volume for equities and showcase them as an ensemble that projects volume in unison. We introduce econometric methods for predicting total and remaining daily volume, intra-day volume profile (u-curve), close auction volume and spec…

2019-04-02abs ↗pdf ↗

New method for analyzing learning dynamics in singular models.

problem Challenges in analyzing learning of singular models with no one-to-one parameter space.
method Relative reparameterization technique to extract regular sub-models.
result Demonstrated differences in convergence behavior due to algorithmic and intrinsic aspects.

In this work we present Ludwig, a flexible, extensible and easy to use toolbox which allows users to train deep learning models and use them for obtaining predictions without writing code. Ludwig implements a novel approach to deep learning model building based on two main abstractions: data types and declarative confi…

2019-09-17abs ↗pdf ↗

Federated Learning is introduced to protect privacy by distributing training data into multiple parties. Each party trains its own model and a meta-model is constructed from the sub models. In this way the details of the data are not disclosed in between each party. In this paper we investigate the model interpretation…

2019-05-11abs ↗pdf ↗

Unified model for market dynamics, linking price and order flow.

problem Modeling market dynamics and order flow in a unified framework.
method Markovian market model driven by a hidden Brownian efficient price, signal-driven and queue-reactive models.
result Stability of mid-price around efficient price at macroscopic scale, behavior as diffusion.

This paper tackles learning functions on manifolds using parallel distributed learning.

problem Learning real-valued functions on manifolds from input-output data pairs.
method Filtered hyperinterpolation and parallel distributed learning.
result Optimal approximation order for non-distributed case, and quantitative relations for distributed case.

This work proposes the Bregman-Tweedie classification model and analyzes the domain structure of the extended exponential function, an extension of the classic generalized exponential function with additional scaling parameter, and related high-level mathematical structures, such as the Bregman-Tweedie loss function an…

2019-07-16abs ↗pdf ↗

This study evaluates the robustness of transformation-based ensemble defense against evasion attacks.

problem Understanding the reasons behind the robustness improvement in transformation-based ensemble defense.
method Designing two adaptive attacks to evaluate transformation-based ensemble defense, conducting experiments to analyze robustness.
result The robustness improvement is mainly from irreversible transformations rather than the ensemble of models.

Estimates hybrid dynamical systems with polynomial expansions and Markovian switching.

problem Identifying hybrid dynamical systems with nonlinear autoregressive exogenous (NARX) components and Markovian switching.
method Probabilistic framework using Expectation Maximization for parameter estimation, including submodel coefficients, hidden state values, and transition probabilities. Disentangles mode classification and NARX regression tasks. Uses soft-labels and coordinate descent approach for parameter fitting.
result Demonstrated on a SMNARX problem with three nonlinear sub-models, achieving parsimonious models through l1-norm bridge estimation and hard-thresholding.

A new method for high-dimensional functional regression reduces multicollinearity and improves interpretability.

problem Multicollinearity, overfitting, and interpretability in high-dimensional functional linear models.
method Partition-based functional ridge regression framework.
result Improved numerical stability and enhanced interpretability without explicit variable selection.

Paper addresses online identification and clustering for mixed linear regression models.

problem Online identification and clustering of mixed linear regression models.
method Introduces two online identification algorithms based on the EM principle, proving global convergence without i.i.d. data assumptions.
result Global convergence of the proposed algorithms for mixed linear regression models.

A real-time federated neural architecture search approach reduces costs and improves performance.

problem High communication and computational demands in federated learning for large models.
method Evolutionary approach with double-sampling technique to optimize model performance and reduce costs.
result Effective real-time federated neural architecture search for deep models on edge devices.

The paper analyzes convergence rates of softmax gating in MoE models.

problem The effectiveness and scalability of machine learning models using MoE.
method Convergence analysis of parameter and expert estimation under MoE with softmax gating and its variants.
result Theoretical results show polynomially many data points are needed for strong identifiability conditions, while exponential points are required for linear experts.

Bayesian inference calibrates Hall thruster model uncertainty at varying pressures.

problem Quantifying uncertainty in a multi-component Hall thruster model at different facility pressures.
method Bayesian inference applied to calibrate and quantify prediction uncertainty in a coupled multi-component Hall thruster model.
result Model reduces predictive errors in thrust and discharge current by more than 50% compared to a previous model.

CoCoAFusE fuses expert predictions to model complex patterns with interpretability and uncertainty.

problem Modeling complex patterns with interpretability and uncertainty quantification.
method Competitive/Collaborative Fusion of Experts (CoCoAFusE) that fuses expert distributions in addition to mixing.
result CoCoAFusE avoids multimodality artifacts and provides tighter credible bounds on the response variable.

Paper addresses global convergence of MLR estimation under weak data conditions.

problem Learning mixed linear regression models with general data conditions.
method Two-step recursive identification algorithm using least squares and EM principles.
result Global convergence and optimal clustering performance established under general data conditions.

Automated method creates compact chemical models from detailed ones, reducing complexity and improving accuracy.

problem Creating accurate low-dimensional chemical kinetic models from detailed ones is time-consuming and requires expert knowledge.
method Machine Learned Optimisation of Chemical Kinetics (MLOCK) algorithm systematically perturbs sub-models to find optimal compact models.
result Compact models (15 species) retain ~87% fidelity to detailed models, outperforming previous methods.