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

105210314419 · Jun 202019922001200920172026
48 results for weighted composition operators

New conditions for weighted composition operators in group homomorphisms.

problem Conditions for weighted composition operators in group homomorphisms.
method Range decreasing group homomorphisms.
result New insights into weighted composition operators and their algebraic structure.

Proposes a new model for clustering multiplex networks with compositional data.

problem Clustering multiplex networks with multiple types of relations and compositional data.
method Multiplex Dirichlet stochastic block model for compositional networks.
result Validated through simulation and applied to international export data.

New method for causal inference with complex treatment compositions.

problem Estimating causal effects with compositional treatments.
method Kernel-based covariate functional balancing approach.
result Achieves n\sqrt{n}-consistency without requiring consistent estimation of weights.

Paper proves multiplicative weight updates can train neural networks without learning rate tuning.

problem Vanishing and exploding gradients in gradient descent for compositional functions.
method Proves descent lemma for compositional functions using multiplicative weight updates and derives Madam optimizer.
result Madam optimizer trains state-of-the-art neural networks without learning rate tuning.

Paper combines geometry and time-series analysis for spatiotemporal data.

problem Multivariate time-series data from multiple sensors.
method Combines manifold learning, Riemannian geometry, and spectral analysis.
result Proposes Riemannian multi-resolution analysis (RMRA) for dynamic mode extraction.

We study b-arc foliation change and exchange move of open book foliations which generalize the corresponding operations in braid foliation theory. We also define a bypass move as an analogue of Honda's bypass attachment operation. As applications, we study how open book foliations change under a stabilization of the op…

2013-09-17abs ↗pdf ↗

We present a learning theory for the training of a linear system operator having an input compositional variable and propose a Bayesian inversion method for inferring the unknown variable from an output of a noisy linear system. We assume that we have partial or even no knowledge of the operator but have training data …

2018-06-29abs ↗pdf ↗

This paper studies robust estimation methods in high dimensions, comparing model-averaged and composite quantile estimators.

problem Understanding robustness in high-dimensional regularized estimation.
method Optimal weights are determined by minimizing the asymptotic mean squared error, incorporating regularization effects without perfect selection.
result Model-averaged and composite quantile estimators often outperform least-squares methods in prediction quality.

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily modified to handle graphs with weighted vertices. We present formulas that simp…

2009-05-29abs ↗pdf ↗

The ERI is a new index for measuring exam readiness.

problem Measuring exam readiness in a clear and actionable way.
method The ERI combines six signals derived from practice and mock tests, formalizing axioms for component maps and the composite.
result The ERI is a composite score interpretable and actionable for exam readiness.

Connected sum and trivalent vertex sum are natural operations on genus 2 spatial graphs and, as with knots, tunnel number behaves in interesting ways under these operations. We prove sharp Scharlemann-Schultens type bounds for the tunnel number of a composite genus 2 spatial graph. For the tunnel number of a composite …

2019-12-18abs ↗pdf ↗

A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a virtual string. In this paper we consider three operations on a virtual string …

2008-08-04abs ↗pdf ↗

We give a complete classification of intertwining operators (symmetry breaking operators) between spherical principal series representations of G=O(n+1,1) and G'=O(n,1). We construct three meromorphic families of the symmetry breaking operators, and find their distribution kernels and their residues at all poles explic…

2013-10-11abs ↗pdf ↗

Maximizes probability of completing investment schedules with optimal portfolio weights.

problem Optimizing probability of completing investment schedules with optimal portfolio weights.
method Computing maximum probability and optimal portfolio weight functions for various rebalancing schedules.
result Noticeable improvements in probability to complete schedules with optimal portfolio weights.

The paper explores using historical data to improve clinical trial analysis by optimizing covariate weights.

problem Limited covariates in small clinical trials reduce the effectiveness of analysis.
method Leverage historical data to pre-specify covariate weights as a composite covariate.
result A composite covariate improves the cost/benefit ratio and reduces overfitting in small clinical trials.

HydaLearn dynamically adjusts task weights for better MTL performance.

problem Constant loss weights in MTL lead to poor results due to drifting relevance and varying mini-batch composition.
method HydaLearn uses mini-batch gradients to dynamically adjust task weights.
result HydaLearn improves performance on synthetic and real-world data.

Operator calculus for population-based optimization provides a unified framework for analyzing convergence of various methods.

problem Convergence analysis of population-based optimization methods
method Introduce an operator calculus for describing composite mean-field algorithms as compositions of elementary operators acting on probability measures.
result Establish a modular Lyapunov principle for certifying exponential decay of state-space Lyapunov function and search errors.

A new model clusters network nodes based on relative edge weights.

problem Clustering networks ignores node capacities, leading to biased results.
method Proposes a Dirichlet stochastic block model for composition-weighted networks.
result Validated on simulated and real-world networks, showing improved clustering accuracy.

This paper studies neural network operators and their convergence properties.

problem Understanding the approximation and convergence of neural network operators.
method Proves density results, convergence estimates, and Voronovskaya-type theorems.
result Establishes quantitative convergence estimates and derives Voronovskaya-type theorems.

Study concavity of solutions to elliptic equations under conformal deformations.

problem Establish concavity estimates for the principle eigenfunction of weighted Schrödinger operators.
method Analyzing the Dirichlet problem for the weighted Schrödinger operator \[-Δu + Vu = λρu\] with conformal connections.
result Partial resolution of Nguyen's conjecture on fundamental gap of horoconvex domains and power convexity estimate for solutions in spherical geometry.

This paper extends compositional data analysis using graph signal processing.

problem Traditional log-ratios between all variables are not suitable for specific variable relationships.
method Linking compositional data analysis with graph signal processing, it considers only selected log-ratios.
result The approach retains desirable properties of scale invariance and compositional coherence.

NeSS combines neural and symbolic approaches for better compositional generalization.

problem Lack of compositional generalization in deep learning models.
method NeSS uses a neural network to generate traces, executed by a symbolic stack machine with sequence manipulation.
result Achieves 100% generalization performance across multiple domains.

This work theoretically investigates the performance of a composite neural network. A composite neural network is a rooted directed acyclic graph combining a set of pre-trained and non-instantiated neural network models, where a pre-trained neural network model is well-crafted for a specific task and targeted to approx…

2019-10-18abs ↗pdf ↗

We present eigenvalue decay estimates of integral operators associated with compositional dot-product kernels. The estimates improve on previous ones established for power series kernels on spheres. This allows us to obtain the volumes of balls in the corresponding reproducing kernel Hilbert spaces. We discuss the cons…

2020-02-28abs ↗pdf ↗

In this paper we determine a number of meaningful compositions of higher order of a set of functions, which is considered in Malesevic (1998), in implicit and explicit form. Results which are obtained are applied to the vector analysis in order to determine the number of meaningful differential operations of higher ord…

2004-09-16abs ↗pdf ↗

For CR structures in dimension three, the CR pluriharmonic functions are characterized by the vanishing of a third order operator. This third order operator, after composition with the divergence operator, gives the fourth order analogue of the Paneitz operator. In this short note, we give criteria under which the kern…

2015-02-06abs ↗pdf ↗

Transformers can generalize to a large task family with only a few demonstrations.

problem Can learning from a small set of tasks generalize to a large task family?
method Investigating autoregressive compositional structure where each task is a composition of TT operations, each from a finite family of DD subtasks.
result Transformers can generalize to DTD^T tasks with only O~(D)\widetilde{O}(D) demonstrations.

New active learning methods for Gaussian process improve predictive modeling of composite fuselage.

problem Improving predictive modeling of composite fuselage with limited training samples and uncertainties.
method Proposed two new active learning algorithms for Gaussian process considering uncertainties.
result The proposed approach realizes better prediction performance for automatic shape control of composite fuselage.

We study losses for binary classification and class probability estimation and extend the understanding of them from margin losses to general composite losses which are the composition of a proper loss with a link function. We characterise when margin losses can be proper composite losses, explicitly show how to determ…

2009-12-17abs ↗pdf ↗

We consider smooth bounded surfaces with a smooth boundary and a prescribed background metric g_0. We now consider all metrics g conformal to g_0 which have a prescribed volume M. We now minimize the first eigenvalue of the Laplace operator of g over the metrics conformal to g_0 and having the prescribed volume. We sho…

2012-08-27abs ↗pdf ↗

In arXiv:0707.2151 the authors introduced the theory of local representations of the quantum Teichmüller space TSq\mathcal{T}^q_S (qq being a fixed primitive NN-th root of (1)N+1(-1)^{N + 1}) and they studied the behaviour of the intertwining operators in this theory. One of the main results [Theorem 20, arXiv:0707.2151] …

2016-10-19abs ↗pdf ↗

New samplers improve compositional generation with diffusion models.

problem Improving compositional generation with diffusion models.
method Score-based interpretation, energy-based parameterization, Metropolis-corrected samplers.
result New samplers enable successful compositional generation across various tasks.

DeepCoDA provides personalized interpretability for complex health data.

problem Interpreting complex health data, especially compositional data, is challenging.
method DeepCoDA framework for high-dimensional compositional data, personalized interpretability through patient-specific weights.
result DeepCoDA maintains state-of-the-art performance and provides coherent, personalized interpretations.