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

63126188251 · Jun 202019922001200920172026
48 results for unbounded weights

New neural network rates for unbounded domains with weighted Sobolev spaces.

problem Improving neural network approximation rates for unbounded domains.
method Embedding results for weighted Fourier-Lebesgue spaces in weighted Sobolev spaces, followed by asymptotic approximation rates.
result Asymptotic approximation rates for shallow neural networks without curse of dimensionality for unbounded domains and Muckenhoupt weights.

New method for Bayesian neural networks with unbounded weights.

problem Posterior inference for Bayesian neural networks with unbounded weights.
method Conditionally Gaussian representation for efficient posterior inference.
result Interpretable and computationally efficient procedure for posterior inference.

Paper tackles unbounded density ratio estimation for covariate shift adaptation.

problem Understudied challenge in statistical learning: unbounded density ratios.
method Three-step estimation method: relative density ratio, truncation, and transformation.
result Established rigorous convergence guarantees for density ratio and regression estimators.

In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature-dimension inequality CDE(n,K)CDE'(n,K), which can be regarded as a notion of curvature on graphs. Furthermore, we obtain some applications of Li-Yau inequality, including Harnack inequality, hea…

2018-01-18abs ↗pdf ↗

Study shows robust method for estimating density ratios even with heavy contamination.

problem Estimating density ratios in the presence of heavy contamination.
method Weighted density ratio estimation (DRE) with doubly strong robustness.
result Weighted DRE achieves sparse consistency under heavy contamination.

We proposed the expected energy-based restricted Boltzmann machine (EE-RBM) as a discriminative RBM method for classification. Two characteristics of the EE-RBM are that the output is unbounded and that the target value of correct classification is set to a value much greater than one. In this study, by adopting featur…

2018-07-25abs ↗pdf ↗

Data analysis in high energy physics has to deal with data samples produced from different sources. One of the most widely used ways to unfold their contributions is the sPlot technique. It uses the results of a maximum likelihood fit to assign weights to events. Some weights produced by sPlot are by design negative. N…

2019-10-17abs ↗pdf ↗

We present a Bayesian formulation of weighted stochastic block models that can be used to infer the large-scale modular structure of weighted networks, including their hierarchical organization. Our method is nonparametric, and thus does not require the prior knowledge of the number of groups or other dimensions of the…

2017-08-04abs ↗pdf ↗

Spectral algorithms improve under covariate shift with novel weighted techniques.

problem Improving spectral algorithms' performance under covariate shift.
method Analysis of spectral algorithms in non-parametric regression over RKHS, proposing a weighted spectral algorithm with clipped weights.
result Normalized weighted spectral algorithm achieves optimal capacity-independent convergence rates, and clipped weights can approach optimal capacity-dependent rates.

In this paper long-run risk sensitive optimisation problem is studied with dyadic impulse control applied to continuous-time Feller-Markov process. In contrast to the existing literature, focus is put on unbounded and non-uniformly ergodic case by adapting the weight norm approach. In particular, it is shown how to com…

2019-06-14abs ↗pdf ↗

The paper shows neural networks can approximate functions over non-compact domains with non-polynomial activation.

problem Approximating functions over non-compact domains using neural networks.
method Using single-hidden-layer feedforward neural networks with non-polynomial activation functions over non-compact subsets of Euclidean spaces.
result Neural networks can approximate functions in weighted CkC^k-spaces and weighted Sobolev spaces over unbounded domains.

Two-layer neural networks must be robust, even with arbitrary weights.

problem Proving the robustness of two-layer neural networks with arbitrary weights.
method Developed a new function-space covering method to prove the robustness law, replacing parameter-space covering.
result Proved the conjectured law for two-layer networks with arbitrary real weights, biases, and affine skip connections.

Two new algorithms improve performance in adversarial bandits with unbounded losses.

problem Adversarial Multi-Armed Bandits with unbounded losses.
method Developed UMAB-NN and UMAB-G for non-negative and general unbounded losses respectively.
result UMAB-NN achieves the first adaptive and scale-free regret bound for non-negative unbounded losses.

We prove semi-empirical concentration inequalities for random variables which are given as possibly nonlinear functions of independent random variables. These inequalities describe concentration of random variable in terms of the data/distribution-dependent Efron-Stein (ES) estimate of its variance and they do not requ…

2019-09-04abs ↗pdf ↗

We study the problem of the existence and the holomorphicity of the Monge-Ampère foliation associated to a plurisubharmonic solutions of the complex homogeneous Monge-Ampère equation even at points of arbitrary degeneracy. We obtain good results for real analytic unbounded solutions. As a consequence we also provide a …

2009-06-25abs ↗pdf ↗

This memoir presents a systematic study of the utility maximization problem of an investor in a constrained and unbounded financial market. Building upon the work of Hu et al. (2005) [Ann. Appl. Probab., 15, 1691--1712] in a bounded framework, we extend our analysis to the more challenging unbounded case. Our methodolo…

2017-07-01abs ↗pdf ↗

It is shown that the compactly supported identity component of the diffeomorphism group of the 2-dimensional punctured torus Tp2\mathbb T^2_p is an unbounded group. It follows that the fragmentation norm of Tp2\mathbb T^2_p is unbounded.

2011-03-18abs ↗pdf ↗

New inequalities for unbounded functions improve denoising score matching.

problem Statistical error bounds for denoising score matching with unbounded objective functions.
method Derive new concentration inequalities using McDiarmid's inequality and Rademacher complexity bounds.
result Improved statistical error bounds for denoising score matching.

Study focal surfaces of wave fronts with unbounded curvatures.

problem Characterizing singularities of focal surfaces near non-degenerate singular points.
method Characterizations based on types of singularities and geometrical properties of initial fronts.
result Investigation of Gaussian curvature behavior of focal surfaces.

Study weighted constant scalar curvature on non-compact toric fibrations, proving K-stability conditions.

problem Investigate weighted constant scalar curvature on non-compact toric fibrations.
method Introduced weighted Futaki invariant and Mabuchi energy, proved K-stability conditions.
result Proved K-stability conditions for certain weights and fibrations.

Study shows unbounded Pontryagin numbers on curved manifolds.

problem Understanding unbounded Pontryagin numbers on curved manifolds.
method Analyzing rational linear combinations of Pontryagin numbers and their relation to the universal elliptic genus.
result Proves existence of unbounded Pontryagin numbers on nonnegatively curved spin manifolds.

Paper tackles online control of linear systems with unbounded noise.

problem Online control of linear systems under unbounded noise with unknown convex cost functions.
method Developed an algorithm achieving ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and established O(mpoly(logT)) O({ m poly} (\log T)) regret bound for strongly convex costs and sub-Gaussian noise.
result Achieved ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and O(mpoly(logT)) O({ m poly} (\log T)) regret bound for specific noise and cost conditions.

Algorithm learns expert weights to minimize regret in adversarial setting.

problem Learning to aggregate expert forecasts with no-regret guarantee in adversarial conditions.
method Online mirror descent algorithm for logarithmic pooling of expert forecasts.
result Achieves O(TlogT)O(\sqrt{T} \log T) expected regret compared to best weights.

New approach finds solutions to games with unbounded controls.

problem Existence of equilibrium in mean-field games with unbounded controls.
method Weak formulation and new existence/stability results for quadratic-growth generalized McKean-Vlasov BSDEs.
result Existence of equilibrium result for non-Markovian mean-field games with unbounded control space.

This work improves polynomial approximations for functions with asymmetric behavior.

problem Efficiently approximating functions with asymmetric behavior, especially those growing unbounded on one side.
method Introduces weighted deep polynomial approximants that combine learnable deep polynomials with one-sided weights.
result Weighted deep polynomial approximants outperform existing methods in approximating functions with asymmetric behavior.

The paper provides gradient estimates for Neumann semigroups on manifolds with boundary under unbounded curvature conditions.

problem Gradient estimates for Neumann semigroups on manifolds with boundary under unbounded curvature conditions.
method Establishes Bismut-type formulas and gradient estimates for Feynman--Kac semigroups on Riemannian manifolds with boundary, under geometric conditions formulated in terms of Ricci curvature and second fundamental form.
result Derives pointwise gradient estimates for the Neumann semigroup under variable, possibly unbounded, lower curvature bounds.

Improved sampling from Gaussian distributions with privacy constraints.

problem Sampling from unbounded Gaussian distributions with differential privacy.
method First $\widetilde{\mathcal{O}}\left(d ight)$-sample algorithm for unbounded Gaussians under $\left(\varepsilon, δ ight)$-differential privacy.
result A quadratic improvement over previous results, settling an open question.

New findings show tool-augmented models can recall unlimited facts, outperforming purely memorized models.

problem Limitations of purely memorized models in recalling large amounts of factual information.
method Demonstrated the benefits of in-tool learning (external retrieval) over in-weight learning (memorization) for factual recall.
result Proved that tool-use enables unbounded factual recall via a simple and efficient circuit construction.