Paper proposes RMFN for multimodal language analysis.
problem Modeling interactions between language, visual, and acoustic modalities.
method Recurrent Multistage Fusion Network (RMFN) decomposes fusion into stages focusing on subsets of multimodal signals.
result RMFN achieves state-of-the-art performance across multimodal sentiment analysis, emotion recognition, and speaker traits recognition datasets.
Proposes Fusion Recurrent Neural Network for sequence data.
problem Improving sequence learning for practical applications.
method Fusion module and Transport module for sequence data.
result Fusion RNN performs comparably to state-of-the-art RNNs.
Two solutions for multi-modal record linkage using Deep Learning inspired by Visual Question Answering.
problem Matching records from multiple sources representing the same entity.
method Two fusion modules: Recurrent Neural Network + Convolutional Neural Network and Stacked Attention Network. A Siamese Neural Network computes similarity.
result Recurrent Neural Network + Convolutional Neural Network fusion module outperforms a simple model.
Study builds complex network from multimodal physiological data.
problem Understanding dynamic interactions in biological systems.
method Network-based multimodal data fusion using recurrence plots and temporal metrics.
result Model accurately characterizes emotional states through physiological responses.
Develops new optimization techniques for decision-making under uncertainty.
problem Decision-making under uncertainty with complex cost functions and nested expectations.
method Introduces Multistage Conditional Compositional Optimization (MCCO) and develops multilevel Monte Carlo techniques.
result New optimization techniques reduce scenario complexity from exponential to polynomial growth.
Regularized recurrent attention filter combines sensor inputs.
problem Combining information from different sensor modalities.
method Regularized recurrent attention filter, co-learning mechanism, probabilistic graphical model.
result Dynamic sensor fusion and latent representation recovery.
With the rising number of interconnected devices and sensors, modeling distributed sensor networks is of increasing interest. Recurrent neural networks (RNN) are considered particularly well suited for modeling sensory and streaming data. When predicting future behavior, incorporating information from neighboring senso…
Novel fusion of autoencoders predicts sleepiness from speech.
problem Predicting sleepiness from speech recordings.
method Attention-based and recurrent sequence to sequence autoencoders for unsupervised representation learning.
result Fusion of autoencoders' representations achieves higher correlation with sleepiness scales.
Paper tackles robust optimization under uncertainty using nested distance.
problem Optimizing under distributionally robust uncertainty with nested distance.
method Equivalent recursive and dynamic programming reformulations for tractable optimization.
result Optimal robust policies can be found efficiently using convex optimization.
New algorithm optimally minimizes convex functions with noisy gradients.
problem Minimizing strongly convex, smooth functions with noisy gradient estimates.
method A multistage accelerated stochastic gradient method with restarts.
result Achieves optimal convergence rate in deterministic and stochastic cases.
The paper introduces methods to solve optimization problems with auxiliary data.
problem Solving multistage optimization problems with uncertain data and auxiliary information.
method Utilizes machine learning techniques like kNN, CART, and RF to develop methods for optimization.
result Demonstrates asymptotic and finite sample optimality of the proposed methods.
Enhanced speech emotion recognition using nonlinear recurrence dynamics.
problem Improving speech emotion recognition accuracy.
method Phase space reconstruction, Recurrence Plot, Recurrence Quantification Analysis, statistical functionals, feature fusion, Bidirectional Recurrent Neural Network.
result State-of-the-art performance on IEMOCAP with up to 10.7% improvement in accuracy.
Optimal multistage method solves noisy minimax problems.
problem Minimizing/maximizing in noisy conditions with smooth and strongly convex-strongly concave settings.
method Multistage Stochastic Gradient Descent Ascent (M-GDA) and Optimistic Gradient Descent Ascent (M-OGDA).
result Achieves optimal linear decay rate with respect to initial error and condition number.
Bayesian optimization tackles expensive cascade processes.
problem Optimizing multistage decision-making processes with expensive costs.
method Formulated as Bayesian optimization framework with two types of acquisition functions.
result Demonstrated effectiveness through numerical experiments and a solar cell simulator application.
The paper introduces new processors for fair credit scoring.
problem Fairness in credit scoring with multiple sensitive variables.
method Logical processors (LP) and Multistage processors (MP).
result Logical processors are effective for handling multiple sensitive variables.
We propose a hybrid algorithmic strategy for complex stochastic optimization problems, which combines the use of scenario trees from multistage stochastic programming with machine learning techniques for learning a policy in the form of a statistical model, in the context of constrained vector-valued decisions. Such a …
Study compares deep learning models for volatility prediction using multivariate data.
problem Predicting volatility using multivariate data.
method Evaluated multiple deep learning models including MLP, RNN, TCN, and Temporal Fusion Transformer.
result Temporal Fusion Transformer and TCN variants outperform classical models and shallow networks.
This paper begins with a study on the dual representations of risk and regret measures and their impact on modeling multistage decision making under uncertainty. A relationship between risk envelopes and regret envelopes is established by using the Lagrangian duality theory. Such a relationship opens a door to a decomp…
Enhanced portfolio selection using sentiment data and LSTM.
problem Improving portfolio selection through sentiment analysis and price prediction.
method Semantic Attention Model for sentiment prediction, LSTM for price prediction, mean-variance strategy for portfolio optimization.
result Sentiment-aware portfolio strategies outperform non-sentiment aware models on average.
Scaling algorithms improve joint training of deep energy-based models.
problem Joint training of deep energy-based models often fails and delivers worse results.
method Proposed online and offline scaling algorithms to fix joint training.
result Scaling algorithms improve joint training and deliver better results.
The paper improves recommendation models by considering user interactions with recommended items.
problem Improving next item prediction in recommendation systems.
method Extending RNN framework with a recommendation action module and state-action fusion module.
result Improved performance on next item prediction compared to baselines.
Multistage Defer Trees improve model accuracy while maintaining interpretability.
problem Balancing model accuracy and interpretability, especially in noisy domains.
method A sequence of sparse decision trees that defer predictions to the next tree or a black box.
result Matches the performance of complex tree-based ensembles while using only one or a few sparse trees.
UniPhyNet improves cognitive load classification accuracy using EEG, ECG, and EDA signals.
problem Classifying cognitive load using multimodal physiological data.
method Unified network architecture integrating multiscale parallel convolutional blocks, ResNet-type blocks, and channel block attention module. Uses bidirectional gated recurrent unit for temporal dependencies.
result Improves raw signal classification accuracy from 70% to 80% (binary) and 62% to 74% (ternary) on CL-Drive dataset.
Develops a two-level monotonic multistage recommender system for better user-specific prediction.
problem Leveraging user-item-stage dependencies in a monotonic chain of events for enhanced prediction accuracy.
method A multistage recommender system with a two-level monotonic property, using a large-margin classifier based on a nonnegative additive latent factor model.
result The proposed method outperforms existing methods in simulations and an article sharing dataset.
Improved robustness in multi-modal sensor fusion with deep learning.
problem Inconsistency in fusion weights leading to poor performance under sensor failures.
method Proposes deep multi-modal sensor fusion architectures with fusion weight regularization and target learning.
result Proposed architectures outperform existing deep learning methods under sensor failures.
The ℓ1-penalized method, or the Lasso, has emerged as an important tool for the analysis of large data sets. Many important results have been obtained for the Lasso in linear regression which have led to a deeper understanding of high-dimensional statistical problems. In this article, we consider a class of weigh…
MRIF models dynamic user interests at multiple temporal-ranges.
problem Capturing dynamic and multi-resolution user interests in recommendation.
method Multi-resolution Interest Fusion (MRIF) model that considers both temporal-ranges and drifts in user interests.
result MRIF outperforms state-of-the-art recommendation methods consistently.
DANCE method improves large-scale learning efficiency via accumulating sample strategy.
problem Efficiently solving large-scale empirical risk minimization problems.
method Distributed Accumulated Newton Conjugate gradient (DANCE) method with multistage approach.
result The method achieves satisfactory statistical accuracy with fewer passes over data.
TFT improves multi-horizon forecasting with interpretable insights.
problem Complex multi-horizon forecasting with mixed inputs.
method Attention-based Temporal Fusion Transformer combining recurrent and self-attention layers.
result Significant performance improvements over existing benchmarks.
Improved graph matching algorithm robust to noise.
problem Finding a bijection between vertex sets of two graphs.
method Uses multistage signature vectors to match vertices.
result Recover matching exactly with high probability for α≤1/(loglogn)C. Meta Fusion integrates various multimodal data fusion strategies into a unified framework.
problem Improving predictive power of machine learning methods across diverse applications.
method Meta Fusion constructs a cohort of models based on latent representations across modalities, sharing soft information to boost performance.
result Meta Fusion consistently outperforms conventional fusion strategies in simulation and real-world applications.
We propose a generalized class of multimodal fusion operators for the task of visual question answering (VQA). We identify generalizations of existing multimodal fusion operators based on the Hadamard product, and show that specific non-trivial instantiations of this generalized fusion operator exhibit superior perform…
New insights into knot fusion numbers via cabling.
problem Understanding fusion numbers of ribbon knots and their behavior under cabling.
method Utilizing knot Floer homology and cabling formulas to analyze fusion numbers.
result The fusion number and strong homotopy fusion number of (p,1)-cable knots are preserved.
Study improves robustness of deep fusion models against single source noise.
problem Ensuring robustness of deep fusion models against noise added to a single input source.
method Proposed two approaches: a carefully designed loss function and a convolutional fusion layer.
result Deep fusion models become robust against noise applied to a single source, preserving performance on clean data.
A new memory-based fusion layer improves multi-modal deep learning performance.
problem Improving performance of multi-modal deep learning by addressing long-term dependencies.
method Introducing a Memory based Attentive Fusion (MBAF) layer that incorporates both current and long-term dependencies.
result The MBAF layer enhances fusion and improves performance across different modalities and networks.
Optimized deep learning architectures improve sensor fusion performance.
problem Sensor fusion in autonomous systems.
method Proposed two optimized architectures: coarser-grained and two-stage gated.
result Significant performance improvements and robustness in noisy conditions.
Improved multi-modal emotion recognition using deep learning.
problem Combining acoustic and text modalities for emotion recognition.
method Proposes a deep learning-based approach to fuse text and acoustic data using SincNet for acoustic features and parallel DCNN and Bi-RNN branches for text processing with cross attention.
result Achieves 3.5% improvement in weighted accuracy compared to existing methods.
A new method uses active learning to improve bile duct stone evaluation.
problem Efficiently collecting necessary patient data in sequential healthcare decisions.
method Developed an active learning-based multistage sequential decision-making model.
result Improves estimation efficiency by 62%-1838% compared to baseline methods.
Innovative 2-categories create 4-manifold invariants.
problem Constructing invariants for 4-manifolds.
method Semisimple 2-categories, fusion 2-categories, and state-sum construction.
result Construct a state-sum invariant for 4-manifolds.
This paper improves image super-resolution by integrating cross-scale non-local attention.
problem Improving image super-resolution by leveraging long-range and cross-scale feature correlations.
method Proposes a Cross-Scale Non-Local (CS-NL) attention module integrated into a recurrent neural network.
result Significantly improved performance on SISR benchmarks.
This paper improves model fusion by training-time neuron alignment, reducing barriers in multi-model fusion.
problem Diverse neuron permutations across different settings hinder model fusion performances.
method Training-time neuron alignment using fixed neuron anchors to reduce training-time permutations.
result Training-time neuron alignment improves fusion of pretrained models and federated learning performances.
We classify all fusion categories for a given set of fusion rules with three simple object types. If a conjecture of Ostrik is true, our classification completes the classification of fusion categories with three simple object types. To facilitate the discussion we describe a convenient, concrete and useful variation o…
Novel fusion network combines polarization and radiomics features for liver cancer classification.
problem Challenges in histopathological diagnosis of HCC and ICC.
method Two-tier fusion approach: feature-level and classification-level.
result Significantly enhances classification accuracy, even at reduced resolutions.
Study fusion methods for financial image views to improve robustness against attacks.
problem Improving robustness of financial image views for next-day direction prediction.
method Same-source multi-view learning with early fusion and late fusion, using OHLCV and technical-indicator views, and evaluating pixel-space L-infinity attacks.
result Early fusion can suffer negative transfer under noisy settings, while late fusion is more reliable once labels stabilize.
New proof and formula linking fusion trees to quantum knot invariants.
problem Quantum knot invariants encoding in non-semisimple TQC.
method Connection between fusion trees and Lawrence representations, using graphical calculus.
result Explicit encoding of quantum knot invariants via fusion trees.
Paper proposes a new method for Bayesian linear regression using spike-and-slab priors.
problem Identifying predictors with similar relationships in linear regression models.
method Hierarchical Bayesian models with spike-and-slab priors and a Gibbs sampler.
result The proposed method outperforms previous methods in simulations and real data analysis.
Enhanced privacy, utility, and efficiency through MUST subsampling.
problem Balancing privacy, utility, and computational efficiency in data analysis.
method MUltistage Sampling Technique (MUST) for privacy amplification in differential privacy.
result MUST offers stronger privacy guarantees (ϵ) than one-stage subsampling methods while maintaining similar utility and computational efficiency. Gradient descent constructs tight fusion frames.
problem Constructing tight fusion frames from prescribed subspaces.
method Gradient descent and symplectic geometry.
result Gradient descent can be used to construct tight fusion frames.