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

64129193257 · Jun 202019922001200920172026
48 results for Integer weights

Neural networks with integer weights approximate continuous functions efficiently.

problem Approximating continuous functions using neural networks with integer weights.
method Integrates superexpressive activation functions and integer weights.
result Convergence rate of order n2β2β+dlog2nn^{\frac{-2β}{2β+d}}\log_2n for neural network regression.

Improved RTM uses integer weights to reduce computation and increase interpretability.

problem Lack of interpretability in nonlinear regression models.
method Integer weighted RTM clauses, combined with a novel learning scheme.
result Significantly reduced computation cost with improved accuracy.

Paper develops machine learning algorithms to learn optimal integer weights for clinical risk scores.

problem Deriving optimal integer weights for clinical risk scores without computational burden.
method Flexible greedy optimization strategy to directly optimize a value function.
result Constructed an integer-weighted comorbidity score for measuring post-discharge mortality risk.

The study examines correlations of logarithms of integers at different scalings.

problem Analyzing pair correlations of logarithms of integers at various scalings.
method Examined correlations of logarithms of positive integers at different scalings, proving the existence of pair correlation functions.
result Level repulsion at linear scaling, total loss of mass at superlinear scalings, and Poissonian behavior at sublinear scalings.

Abstract: Necessary and sufficient conditions for circle actions on 4-manifolds with discrete fixed points.

problem Conditions for circle actions on 4-manifolds with discrete fixed points.
method Demonstrated pairs of integers that arise as weights of a circle action also arise as weights of a restriction of a T2\mathbb{T}^2-action.
result Provided necessary and sufficient conditions for pairs of integers to arise as weights and Chern numbers of circle actions.

Best-of-\infty improves LLM performance by efficiently allocating inference-time computation.

problem Achieving optimal performance in test-time LLM ensembling with infinite budget.
method Adaptive generation scheme and weighted ensembles of LLMs, formulated as mixed-integer linear program.
result Optimal ensemble weighting improves performance over individual models.

Low bit-width integer weights and activations are very important for efficient inference, especially with respect to lower power consumption. We propose Monte Carlo methods to quantize the weights and activations of pre-trained neural networks without any re-training. By performing importance sampling we obtain quantiz…

2019-05-29abs ↗pdf ↗

The paper analyzes how behavioral investors make portfolio decisions using Markowitz Stochastic Dominance criteria.

problem Understanding how behavioral investors make portfolio decisions.
method Developed stochastic optimization problems and MILP models to capture subjective decision weights and probability weighting functions.
result The developed models can be used to formulate computationally tractable portfolio analysis problems.

Conjecturally, the only knots in S3S^3 with non-integer surgeries producing Seifert fibered spaces are torus knots and cables of torus knots. In this paper, we make progress on the associated realization problem. Let YY be a small Seifert fibered space arising by p/qp/q-surgery on a knot in S3S^3, where p/qp/q is positi…

2018-10-03abs ↗pdf ↗

ExDBN learns dynamic Bayesian networks using mixed-integer programming.

problem Learning dynamic causal relationships from time series data.
method Score-based learning algorithm using mixed-integer quadratic programming with branch-and-cut method.
result The proposed method produces more accurate results than state-of-the-art approaches.

We prove that if N2N\ge 2 and α:FNπ1(Γ)α: F_N\to π_1(Γ) is a marking on FNF_N, then for any integer r2r\ge 2 and any FNF_N-invariant collection of non-negative integral "weights" associated to all subtrees KK of Γ~\widetilde Γ of radius r\le r satisfying some natural "switch" conditions, there exists a finite cyclically red…

2012-11-26abs ↗pdf ↗

The Penrose theorem and Hawking's topology theorem are extended to weighted spacetimes.

problem Extending Penrose's singularity theorem and Hawking's topology theorem to weighted spacetimes.
method Using weighted null energy condition and synthetic dimension to generalize the theorems.
result Generalized versions of the Penrose and Hawking theorems hold under a weighted null energy condition.

For p>3 a prime, and g>2 an integer, we use Topological Quantum Field Theory (TQFT) to study a family of p-1 highest weight modules L_p(lambda) for the symplectic group Sp(2g,K) where K is an algebraically closed field of characteristic p. This permits explicit formulae for the dimension and the formal character of L_p…

2016-06-30abs ↗pdf ↗

We introduce a new series RkR_k, k=2,3,4,k=2,3,4,\dots, of integer valued weight systems. The value of the weight system RkR_k on a chord diagram is a signed number of cycles of even length 2k2k in the intersection graph of the diagram. We show that this value depends on the intersection graph only. We check that for small o…

2013-07-18abs ↗pdf ↗

Optimizes experimental design using synthetic controls for better outcomes.

problem Estimating average treatment effects in studies with pre-treatment data.
method Mixed-integer programming for selecting treated and control units and weights.
result Improves mean squared error and statistical power compared to simple alternatives.

Study on a weighted Suita conjecture for higher derivatives and their geometric properties.

problem Analyzing the Suita conjecture for higher derivatives with weights.
method Examining the set of points for equality in a weighted Suita conjecture and relating it to harmonic functions and Dirichlet problems.
result Relations between the set of points and integer-valued points of harmonic functions and Dirichlet problems for planar domains.

Mixed integer programming identifies critical neurons in neural networks.

problem Identifying neurons critical for network performance and generalization.
method Developed a mixed integer program (MIP) to assign importance scores to neurons, guiding pruning decisions.
result The method identifies multiple 'lucky' sub-networks resulting in optimized architectures that generalize across datasets.

Study links K-stability of certain surfaces to binary forms, proving stability and non-stability conditions.

problem Investigating K-stability of specific del Pezzo surfaces.
method Relating K-stability to GIT stability of binary forms, proving stability and non-stability conditions.
result K-polystability and non-K-stability of quasi-smooth hypersurfaces.

Hardware-accelerated RBM solves large combinatorial problems and integer factorization.

problem Solving large combinatorial optimization and integer factorization problems.
method Logically synthesized RBM architecture, hardware acceleration, and efficient training methods.
result Hardware-accelerated RBM factorizes 16-bit numbers with 10000x speed and 32x power improvements.

FairWASP optimizes training data to reduce disparities across subgroups.

problem Reducing disparities in model outputs across different subgroups in machine learning.
method A novel pre-processing approach that minimizes Wasserstein distance to the original dataset while satisfying demographic parity.
result Integer weights are optimal, allowing FairWASP to be understood as duplicating or eliminating samples.

Study integrates reliability constraints into generation planning models.

problem Challenges in integrating reliability constraints with generation planning models.
method Leverages a weighted oblique decision tree (WODT) technique to embed reliability verification constraints.
result Demonstrates effectiveness in achieving reliable and optimal planning solutions.

The purpose of this paper is twofold. On one hand, we introduce a modification of the dual canonical basis for invariant tensors of the 3-dimensional irreducible representation of Uq(sl2)U_q(sl_2), given in terms of Jacobi diagrams, a central tool in quantum topology. On the other hand, we use this modified basis to study t…

2015-07-16abs ↗pdf ↗

In this paper we consider the field equations for linearized gravity and other integer spin fields on the Kerr spacetime, and more generally on spacetimes of Petrov type D. We give a derivation, using the GHP formalism, of decoupled field equations for the linearized Weyl scalars for all spin weights and identify the g…

2010-09-28abs ↗pdf ↗

Improved neural quantization reduces accuracy loss to less than 1% with 4-bit weights.

problem Reducing accuracy loss in neural quantization below 8-bits.
method Layer-wise calibration and integer programming to optimize bit-width allocation.
result Less than 1% accuracy degradation with 4-bit weights and activations.

Study of coloured invariants of torus knots using W\mathcal{W} algebras.

problem Understanding coloured invariants of torus knots T(p,p)T(p,p').
method Representation theory of principal affine W\mathcal{W} algebras and asymptotic weight multiplicities.
result Limits of renormalized invariants are equal to characters of W\mathcal{W} algebra modules.

Solves constant mean curvature Dirichlet problem on catenoids with improved estimates.

problem Solving constant mean curvature Dirichlet problem on catenoidal necks.
method Found solutions in exponentially weighted Hölder spaces with non-integer weight.
result Improved estimate to γ=1 by comparing solutions with their limits on the disk.

The study counts periodic orbits on smooth manifolds, adding ghost orbits for completeness.

problem Counting periodic orbits of vector fields on smooth closed manifolds.
method Enlarging the space of orbits to include ghost orbits, defining weight functions, and showing constancy under deformation.
result The weight function remains constant as the vector field moves and ΓΓ deforms.

We improve deep threshold networks' memorization capacity exponentially.

problem Memorizing datasets with randomized labels using deep neural networks.
method Using Gaussian random weights in the first layer and binary or integer weights in subsequent layers, we prove a new dependence on minimum distance.
result We show that O~(1δ+n)\widetilde{\mathcal{O}}(\frac{1}{\delta} + \sqrt{n}) neurons and O~(dδ+n)\widetilde{\mathcal{O}}(\frac{d}{\delta} + n) weights are sufficient.

Let T be a torus of dimension at least k and M a T-manifold. M is a GKM_k-manifold if the action is equivariantly formal, has only isolated fixed points, and any k weights of the isotropy representation in the fixed points are linearly independent. In this paper we compute the cohomology rings with real and integer coe…

2014-02-11abs ↗pdf ↗

Optimizes risk assessment tools using mixed-integer programming.

problem Challenges in healthcare risk assessment due to label scarcity and asymmetric misclassification costs.
method Jointly optimizes scoring weights and category thresholds via mixed-integer programming (MIP).
result Prevents label-scarce category collapse and achieves more accurate risk categorization.

The involutory birack counting invariant is an integer-valued invariant of unoriented tangles defined by counting homomorphisms from the fundamental involutory birack of the tangle to a finite involutory birack over a set of framings modulo the birack rank of the labeling birack. In this first of an anticipated series …

2012-08-16abs ↗pdf ↗

This study optimizes cycle representatives in persistent homology using linear programming.

problem Non-uniqueness of cycle representatives in persistent homology creates ambiguity.
method Optimization of cycle representatives using linear programming methods.
result Optimization reduces the size of cycle representatives and is effective in most data sets.

A {\em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita \cite{ki}), and examine their behavior under some common operations on the graph. We…

2015-06-19abs ↗pdf ↗

This paper shows universality in spectrum behavior for random inner-product kernel matrices in polynomial regime.

problem Understanding spectrum behavior of random inner-product kernel matrices in polynomial regime.
method Analyzing matrices formed by a nonlinear function applied entrywise to a sample-covariance matrix, considering i.i.d. entries with all finite moments.
result The spectrum of random inner-product kernel matrices is universally described by the free convolution of the semicircular and Marčenko-Pastur distributions, with relative weights given by expanding the nonlinear function in the Hermite basis.

Derives Selberg trace formula on Riemann surfaces and generalizes to other spaces.

problem Deriving and generalizing the Selberg trace formula.
method Supersymmetric localization principle and path integral derivation.
result Derives Selberg trace formula on arbitrary compact Riemann surfaces and generic compact locally symmetric spaces.

New q-deformed integers help compute Jones polynomials efficiently.

problem Computing Jones polynomials of rational links efficiently.
method Defining q-deformed integers from pairs of coprime integers and using them to compute Jones polynomials.
result Efficient algorithm for computing Jones polynomials of rational links.

We present a novel optimization strategy for training neural networks which we call "BitNet". The parameters of neural networks are usually unconstrained and have a dynamic range dispersed over all real values. Our key idea is to limit the expressive power of the network by dynamically controlling the range and set of …

2017-08-16abs ↗pdf ↗

Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by non-negative integer weights, 14 for each 3-simplex, that describe how many copies o…

2007-06-05abs ↗pdf ↗

Proposes a method to learn both constraints and objective functions from data.

problem Data-driven inverse optimization for mixed-integer linear programs (MILPs).
method Two-stage approach: first learns constraints, then estimates objective-function weights conditioned on learned constraints.
result Proposes and validates a method for learning both objective functions and constraints from data.

Generalized Steinberg module presentation for Gaussian and Eisenstein integers.

problem Presenting Steinberg modules for specific number rings.
method Generalization of Bykovskii's presentation to Gaussian and Eisenstein integers.
result Generalization does not yield a presentation for all Euclidean number rings.

Hybrid LLM and quantum optimization improve CSA collateral management by 9-10%.

problem Finance-native collateral optimization under ISDA CSAs with legal constraints.
method Hybrid pipeline combining LLM, quantum-inspired exploration, and CP-SAT.
result Improves a strong classical baseline by 9.1-10.7% across different scenarios.