We propose a penalized likelihood method to jointly estimate multiple precision matrices for use in quadratic discriminant analysis and model based clustering. A ridge penalty and a ridge fusion penalty are used to introduce shrinkage and promote similarity between precision matrix estimates. Block-wise coordinate desc…
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.
169,181 papers · 148 categories
Trend · papers per month
48 results for “fusion penalties”
Proposes a method to cluster data with missing entries using non-convex penalties.
problem Challenges of clustering data with missing entries.
method Uses a relaxation of a fusion penalty optimization problem with saturating non-convex fusion penalties.
result The proposed method produces solutions that degrade gradually with increasing missing feature values.
A new method for combining multiple data views in supervised learning.
problem Combining multiple data views in supervised learning, especially in biology and medicine.
method Cooperative learning combines squared error loss with an agreement penalty to encourage predictions from different data views to agree.
result Cooperative learning achieves higher predictive accuracy on simulated and real multiomics data.
New clustering algorithm handles missing data effectively.
problem Handling missing entries in large datasets.
method Solves an fusion penalty based optimization problem to recover clusters.
result The method successfully recovers clusters even with large missing data fractions.
Unified method for simultaneous denoising and clustering.
problem Clustering noisy signals.
method Sparse convex wavelet clustering with fusion and group-sparse penalties.
result Unified approach that denoises and clusters simultaneously.
A new method for multivariate regression with clustering.
problem Multivariate regression with clustering structure.
method Cluster Elastic Net with fusion and L1 penalties.
result The method effectively estimates coefficients and clusters.
Graph-Structured Multi-task Regression and an Efficient Optimization Method for General Fused Lassostat.ML
We consider the problem of learning a structured multi-task regression, where the output consists of multiple responses that are related by a graph and the correlated response variables are dependent on the common inputs in a sparse but synergistic manner. Previous methods such as l1/l2-regularized multi-task regressio…
FIRE extracts interpretable rules from tree ensembles.
problem Building sparse and interpretable rule sets from tree ensembles.
method Optimization-based framework with fusion regularization and sparsity-inducing penalties.
result FIRE outperforms state-of-the-art rule ensemble algorithms.
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input or output sides. We consider two widely adopted types of such penalties as our motivating examples: 1) overlapping group lasso penalty, base…
SCOPE fuses categorical variable levels to estimate high-dimensional linear models.
problem Estimating high-dimensional linear models with nominal categorical data.
method SCOPE uses nonconvex concave penalties to fuse levels and achieve efficient computation.
result SCOPE achieves oracle least squares solution under certain conditions.
Proposes SROF for row-wise fusion in federated learning for multivariate responses.
problem Heterogeneous client models with shared variable-level structure.
method Sparse Row-wise Fusion (SROF) regularizer and RowFed algorithm.
result Empirically shows consistent error reduction and stronger variable-level cluster recovery.
New algorithm clusters data from full or incomplete datasets.
problem Clustering incomplete data with standard methods.
method Fusion penalties for subspace clustering.
result Approach performs comparably to state-of-the-art with complete data, and better with missing data.
Fuses ITRs for primary and secondary outcomes to minimize harm.
problem Learn an ITR maximizing primary outcome while minimizing harm to secondary outcomes.
method Introduces fusion penalty to encourage similar recommendations for different outcomes. Two algorithms estimate the ITR using surrogate loss functions.
result Agreement rate between primary and secondary optimal ITRs converges faster than ignoring secondary outcomes.
FILTER model uses fusion penalized logistic threshold regression for high-dimensional data with unknown cut points.
problem Modeling high-dimensional data with unknown cut points and binary responses.
method Fusion penalized logistic threshold regression (FILTER) model with fused lasso penalty for variable selection.
result Established non-asymptotic error bounds for coefficient estimation and model selection consistency.
New method for clustering tasks with heterogeneous data.
problem Clustered multitask learning with semiparametric and heterogeneous nuisances.
method Adaptive fused orthogonal estimator with Neyman-orthogonal losses and data-driven fusion penalties.
result Achieves exact clustering recovery and pooled parametric convergence rates.
SBCA optimizes portfolios by fusing price data and text sentiment.
problem Insufficient integration of multi-modal information in traditional portfolio optimization models.
method Cross-modal BERT-driven Actor-Critic framework with gated fusion and constraint embedding.
result SBCA outperforms benchmarks in portfolio value, return, Sharpe ratio, and maximum drawdown.
Training neural networks under physical constraints using a stochastic augmented Lagrangian approachphysics.comp-ph
Stochastic approach improves neural network training for kinetic simulations.
problem Training neural networks under physical constraints in kinetic fusion simulations.
method Stochastic augmented Lagrangian approach using pyTorch.
result Higher model prediction accuracy achieved compared to fixed penalty method.
ESE-FN improves elderly activity recognition accuracy.
problem Recognizing individual actions and human-object interactions in elderly activities.
method Exploits multi-modal features from RGB videos and skeleton sequences using ESE attentions and a new Multi-modal Loss.
result ESE-FN achieves best accuracy on ETRI-Activity3D 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.
Improved VQA accuracy with generalized fusion operators.
problem Enhancing multimodal fusion for better VQA performance.
method Generalized Hadamard-Product fusion operators with Nonlinearity Ensembling, Feature Gating, and post-fusion layers.
result 1.1% absolute improvement on VQA 2.0 test-dev set.
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.
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.
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.
Supervised Convex Clusteringstat.ME
SCC clusters data with supervising variables for better interpretation.
problem Challenging interpretations in unsupervised clustering.
method Joint convex fusion penalty using supervising and unlabeled data.
result Discover new genes and subtypes of Alzheimer's Disease.
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.
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 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.
Survey of Locally Linear Embedding and its variants.
problem Representing high-dimensional data in a lower-dimensional space while preserving local structure.
method Explains various LLE and variant methods, including kernel LLE, inverse LLE, feature fusion, out-of-sample embedding, incremental LLE, landmark LLE, supervised LLE, robust LLE, fusion with other methods, and weighted LLE.
result Comprehensive overview of LLE and its variants.
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.
Generalized Bilinear Deep Convolutional Neural Networks for Multimodal Biometric Identificationcs.LG
Proposes a new CNN approach for multimodal biometric identification.
problem Improving biometric identification accuracy across multiple modalities.
method Uses a bank of modality-specific CNNs, fuses their outputs, and optimizes the system.
result Significantly outperforms unimodal systems and demonstrates reduction in parameters.
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.
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.
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.
A lot of attention has been devoted to multimedia indexing over the past few years. In the literature, we often consider two kinds of fusion schemes: The early fusion and the late fusion. In this paper we focus on late classifier fusion, where one combines the scores of each modality at the decision level. To tackle th…
Study Coxeter groups over fusion rings and their geometric realisations.
problem Understanding Coxeter groups and their embeddings.
method Investigate faithful realisations and Vinberg systems.
result Induce embeddings of hyperplane complements.
Constructs a fusion product on spinor bundle over loop space.
problem Describes a fusion product on the spinor bundle over loop space.
method Uses Connes fusion of von Neumann bimodules and string structures.
result Establishes a novel relation between string structures, loop fusion, and Connes fusion of Fock spaces.
New methods for co-clustering improve efficiency of convex formulations.
problem Simultaneously identifying clusters across multiple aspects of a data set.
method Three operator-splitting ADMM methods for convex co-clustering.
result The Generalized ADMM is more efficient for large problems.
Bayesian fusion improves radar target recognition for UAVs.
problem Improving radar target recognition for UAVs using multistatic radar configurations.
method Proposes a fully Bayesian RATR framework using Optimal Bayesian Fusion (OBF) to aggregate classification probability vectors from multiple radars.
result Empirical results show that the OBF method significantly enhances classification accuracy compared to other fusion methods and single radar configurations.
Adversarial approach enhances sensor fusion for robust target detection.
problem Improving target detection and classification using multi-modal sensor fusion.
method Generative network learns latent space from various sensor modalities, then detects damaged sensors and safeguards performance.
result Automatic robustness against noisy/damaged sensors achieved.
Constructs a lift of fusion for spinors on the circle using Tomita-Takesaki theory.
problem Fusion of operators on spinors on the circle.
method Uses Tomita-Takesaki theory for Clifford-von Neumann algebras.
result Lifts fusion to a central extension of implementers on a Fock space.
Fusion of transformer networks using optimal transport for improved performance.
problem Improving performance of transformer-based models through fusion.
method Exploiting optimal transport for soft alignment of transformer components.
result Consistently outperforms vanilla fusion and individual parent models.
Paper proposes a method to preserve multimodal sentiment analysis fidelity.
problem Lack of fidelity in multimodal fusion for sentiment analysis.
method Variational autoencoder-based approach for modality fusion.
result Empirically shows superior performance over state-of-the-art methods.
The paper analyzes how shared priors affect Bayesian data fusion performance.
problem Effect of shared priors on Bayesian data fusion performance.
method Theoretical analysis using two divergences common in Bayesian inference.
result Theoretical analysis and experimental validation of performance behavior.