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

Trend · papers per month

4896144192 · May 202619922001200920172026
48 results for fused operators

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 ↗

A wide class of regularization problems in machine learning and statistics employ a regularization term which is obtained by composing a simple convex function ωwith a linear transformation. This setting includes Group Lasso methods, the Fused Lasso and other total variation methods, multi-task learning methods and man…

2011-04-07abs ↗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.

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.

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 paper studies algebraic structures related to quantum groups.

problem Understanding centralisers of tensor representations of Uq(glN)U_q(gl_N).
method Introducing fused permutations and braids, proving Schur--Weyl duality, and describing centralisers.
result A conjecture about a generating element of centralisers is proven in some cases.

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 ↗

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 ↗

Introduce Collapsed Effective Operators for higher-order structures.

problem Existing spectral operators decompose topology into separate ranks, leaving practitioners to fuse information back to vertices.
method Introduce Collapsed Effective Operators via Schur complementation of a graded Laplacian.
result Preserves positive semi-definiteness, lowers system energy under higher-order connectivity.

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 ↗

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 ↗

MASnet enhances speech on mobile devices with low latency.

problem Efficiently enhancing speech on mobile devices with low latency.
method MASnet processes linear-scale spectrograms, using ratio masks to enhance noisy frames, and operates in low-latency incremental inference mode.
result MASnet achieves efficient speech enhancement with low latency, reducing FMA/s operations.

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.

In the present paper, we consider local moves on classical and welded diagrams: (self-)crossing change, (self-)virtualization, virtual conjugation, Delta, fused, band-pass and welded band-pass moves. Interrelationship between these moves is discussed and, for each of these move, we provide an algebraic classification. …

2015-10-14abs ↗pdf ↗

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.

A framework assesses the quality of crowdsourced weather data.

problem Quality control and assessment of crowdsourced weather data from third-party stations.
method Proposes a simple, scalable, and interpretable AI/Stats/ML framework to assess TPAWS data.
result Demonstrates the performance of the framework using synthetic and real data.

Bayesian and POD methods fuse noisy wind tunnel and simulated aerodynamic data.

problem Fusing data from wind tunnel measurements and numerical simulations for accurate aerodynamic modeling.
method Bayesian and Proper Orthogonal Decomposition (POD) methods to infer true aerodynamic fields.
result Bayesian method is more robust with scarce data and accounts for uncertainties.

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.

CAF-HFCM automatically forms a cluster hierarchy and optimizes the number of clusters without trial-and-validation.

problem Challenges in determining the optimal number of clusters in fuzzy c-means.
method CAF-HFCM, an auto-fused hierarchical fuzzy c-means method.
result Automatic agglomeration and optimal number of clusters without validity indices.

During the past years there has been an explosion of interest in learning methods based on sparsity regularization. In this paper, we discuss a general class of such methods, in which the regularizer can be expressed as the composition of a convex function ωω with a linear function. This setting includes several metho…

2013-03-25abs ↗pdf ↗

In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form solutions of proximal operators and envelope representations based on the Moreau, Fo…

2015-02-11abs ↗pdf ↗

Incorporation of a new knowledge into neural networks with simultaneous preservation of the previous one is known to be a nontrivial problem. This problem becomes even more complex when new knowledge is contained not in new training examples, but inside the parameters (connection weights) of another neural network. Her…

2018-09-25abs ↗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.

Unified parallel ADMM for high-dimensional regression with combined regularizations.

problem Efficiently solving high-dimensional regression problems with combined regularization terms in parallel.
method Unified constrained optimization formulation based on consensus problem, parallel ADMM algorithms.
result Global convergence and linear convergence rate of the proposed algorithm.

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.