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,657 papers · 148 categories

Trend · papers per month

23477093 · Jun 202019922001200920172026
48 results for fused links

All knots are fused isotopic to the unknot via a process known as virtualization. We extend and adapt this process to show that, up to fused isotopy, classical links are classified by their linking numbers.

2006-06-08abs ↗pdf ↗

We construct the complete invariant for fused links. It is proved that the set of equivalence classes of nn-component fused links is in one-to-one correspondence with the set of elements of the abelization UVPn/UVPnUVP_n/UVP_n^{\prime} up to conjugation by the elements from the symmetric group Sn<UVBnS_n<UVB_n.

2015-10-31abs ↗pdf ↗

The theory of signature invariants of links in rational homology spheres is applied to covering links of homology boundary links. From patterns and Seifert matrices of homology boundary links, an explicit formula is derived to compute signature invariants of their covering links. Using the formula, we produce fused bou…

2001-08-30abs ↗pdf ↗

As a fundamental problem in many different fields, link prediction aims to estimate the likelihood of an existing link between two nodes based on the observed information. Since this problem is related to many applications ranging from uncovering missing data to predicting the evolution of networks, link prediction has…

2014-09-30abs ↗pdf ↗

The fused lasso penalizes a loss function by the L1L_1 norm for both the regression coefficients and their successive differences to encourage sparsity of both. In this paper, we propose a Bayesian generalized fused lasso modeling based on a normal-exponential-gamma (NEG) prior distribution. The NEG prior is assumed in…

2016-02-16abs ↗pdf ↗

The solution path of the 1D fused lasso for an nn-dimensional input is piecewise linear with O(n)\mathcal{O}(n) segments (Hoefling et al. 2010 and Tibshirani et al 2011). However, existing proofs of this bound do not hold for the weighted fused lasso. At the same time, results for the generalized lasso, of which the wei…

2018-01-15abs ↗pdf ↗

We propose a novel fused Gromov-Wasserstein alignment method to jointly learn the Hawkes processes in different event spaces, and align their event types. Given two Hawkes processes, we use fused Gromov-Wasserstein discrepancy to measure their dissimilarity, which considers both the Wasserstein discrepancy based on the…

2019-10-04abs ↗pdf ↗

The fused lasso is analyzed for high-dimensional piecewise-constant regression coefficients.

problem Estimation of high-dimensional piecewise-constant regression coefficients.
method Formulated a restricted isometry condition for the fused lasso estimator and derived estimation bounds.
result The estimation error can be dominated by either the lasso or the fused lasso rate, depending on the number of non-zero coefficients and piece-wise constant segments.

The Lasso is a very well known penalized regression model, which adds an L1L_{1} penalty with parameter λ1λ_{1} on the coefficients to the squared error loss function. The Fused Lasso extends this model by also putting an L1L_{1} penalty with parameter λ2λ_{2} on the difference of neighboring coefficients, assuming the…

2009-10-03abs ↗pdf ↗

The thesis explores centralisers and Hecke algebras in representation theory with applications to knots and physics.

problem Understanding centralisers and Hecke algebras in representation theory.
method Review of classical and quantum Schur-Weyl duality, discussion of quantum groups and their centralisers, and application to knot theory and physics.
result New insights into centralisers and Hecke algebras, leading to solutions for the Yang-Baxter equation and link invariants.

We study the property of the Fused Lasso Signal Approximator (FLSA) for estimating a blocky signal sequence with additive noise. We transform the FLSA to an ordinary Lasso problem. By studying the property of the design matrix in the transformed Lasso problem, we find that the irrepresentable condition might not hold, …

2012-11-22abs ↗pdf ↗

The paper develops estimators for variance in graph structures using fused lasso.

problem Variance estimation in graph-structured problems.
method Developed linear time estimator for homoscedastic case and total variation regularization estimator for heteroscedastic case.
result Minimax rates and consistency for variance estimation in various graph structures.

New autoencoder improves latent space learning by optimizing sliced Gromov-Wasserstein discrepancies.

problem Improving inner discrepancy between prior and posterior distributions in autoencoders.
method Proposed spherical sliced fused Gromov Wasserstein (SSFG) and variants (MSSFG, PSSFG) to find important directions.
result New autoencoders achieve favorable performance in latent manifold learning, image generation, and reconstruction.

We propose a new algorithm for solving the graph-fused lasso (GFL), a method for parameter estimation that operates under the assumption that the signal tends to be locally constant over a predefined graph structure. Our key insight is to decompose the graph into a set of trails which can then each be solved efficientl…

2015-05-24abs ↗pdf ↗

New method estimates mixture model components efficiently.

problem Estimating the number of components in finite mixture models.
method Group-Sort-Fuse (GSF) procedure for simultaneous estimation of order and mixing measure.
result GSF achieves consistent estimation of true mixture order and n1/2n^{-1/2} convergence rate.

Convolutional neural networks (CNNs) with residual links (ResNets) and causal dilated convolutional units have been the network of choice for deep learning approaches to speech enhancement. While residual links improve gradient flow during training, feature diminution of shallow layer outputs can occur due to repetitiv…

2020-02-27abs ↗pdf ↗

DoRA improves adaptation efficiency for large models by factoring norms and fusing kernels.

problem High-rank DoRA is computationally expensive and infeasible on common GPUs.
method Factored norms and fused Triton kernels to reduce memory and speed up computation.
result Fused implementation is up to 2.0x faster for inference and 1.9x faster for gradient computation.

We consider the fusion of two aerodynamic data sets originating from differing fidelity physical or computer experiments. We specifically address the fusion of: 1) noisy and in-complete fields from wind tunnel measurements and 2) deterministic but biased fields from numerical simulations. These two data sources are fus…

2019-11-02abs ↗pdf ↗

Fused Encoder Networks improve momentum strategies on crypto data.

problem Deploying momentum strategies on crypto data with limited samples leads to over-fitted models.
method Hybrid transfer learning model combining source and target datasets.
result Fused Encoder Networks outperform classical momentum strategies and benchmarks.

We present the group fused Lasso for detection of multiple change-points shared by a set of co-occurring one-dimensional signals. Change-points are detected by approximating the original signals with a constraint on the multidimensional total variation, leading to piecewise-constant approximations. Fast algorithms are …

2011-06-21abs ↗pdf ↗

Paper introduces a novel framework for supervised graph prediction using Optimal Transport.

problem Supervised labeled graph prediction.
method Fused Gromov-Wasserstein (FGW) loss and FGW barycenter with neural network weights and learned graphs.
result The method can interpolate in the labeled graph space and achieve good performance on difficult problems.

Enhances graph comparison by incorporating edge features using Fused Gromov-Wasserstein distance.

problem Graph distances overlook edge attributes, limiting their effectiveness.
method Introduced Fused Gromov-Wasserstein distance for graph comparison with edge features. Proposed algorithms for distance and barycenter computation.
result Empirically validated the effectiveness of the novel distance in graph learning tasks.

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.

ABM automates feature engineering and variable selection for loss-based models.

problem Improving model performance through better feature engineering and variable selection.
method ABM uses group and fused lasso regularization to automatically select cutting points and variables.
result ABM integrates feature engineering, variable selection, and model training.

Proposes a method to improve regression model performance with limited target data using fused-regularizer.

problem Model shifts and covariate shifts in high-dimensional regression.
method Two-step method with fused-regularizer to leverage source data for target task.
result Robust to covariate shifts, minimax-optimal under certain conditions, and validated by numerical tests.

MCFNet recovers spatial detail and fuses it with semantic information for real-time segmentation.

problem Recovering spatial detail information and fusing it with semantic information in real-time.
method Proposes a new architecture (MCFNet) with feature refinement and fusion modules, and a gating unit.
result Achieves competitive performance with high speed (75.5% mIOU, 151.3 FPS on Cityscapes).

We consider the problem of predicting an outcome variable using pp covariates that are measured on nn independent observations, in the setting in which flexible and interpretable fits are desirable. We propose the fused lasso additive model (FLAM), in which each additive function is estimated to be piecewise constant…

2014-09-18abs ↗pdf ↗

We consider efficient implementations of the generalized lasso dual path algorithm of Tibshirani and Taylor (2011). We first describe a generic approach that covers any penalty matrix D and any (full column rank) matrix X of predictor variables. We then describe fast implementations for the special cases of trend filte…

2014-05-13abs ↗pdf ↗

Framework optimizes expensive manufacturing processes efficiently.

problem Optimizing input parameters for advanced manufacturing methods.
method Bayesian optimization with tailored acquisition function and parallel acquisition.
result Framework efficiently finds optimal parameters with minimal process cost.

ScoreFusion fuses multiple diffusion models to enhance generative modeling of a target population.

problem Enhancing generative modeling of a target population with limited data.
method ScoreFusion uses KL barycenters of auxiliary populations and recasts the learning problem as score matching in denoising diffusion.
result ScoreFusion achieves a dimension-free sample complexity bound in total variation distance.

A new estimator reduces bias and improves efficiency for staggered adoption studies.

problem Bias in difference-in-differences estimates for staggered adoption studies.
method Fused Extended Two-Way Fixed Effects (FETWFE) estimator with automatic parameter selection.
result FETWFE identifies correct restrictions with probability tending to one, improving efficiency.

Multivariate time series forecasting is an important yet challenging problem in machine learning. Most existing approaches only forecast the series value of one future moment, ignoring the interactions between predictions of future moments with different temporal distance. Such a deficiency probably prevents the model …

2019-12-11abs ↗pdf ↗

Kernel fusion is a popular and effective approach for combining multiple features that characterize different aspects of data. Traditional approaches for Multiple Kernel Learning (MKL) attempt to learn the parameters for combining the kernels through sophisticated optimization procedures. In this paper, we propose an a…

2016-12-28abs ↗pdf ↗