New method improves deep RL by combining emphatic weightings with replay data.
problem Improving sample efficiency and scaling model-free RL methods.
method Developed a multi-step emphatic weighting and time-reversed n n n -step TD learning algorithm. result The new approach reduces variance and provides convergence guarantees.
A new theorem and algorithm solve off-policy policy gradient problems.
problem Solving the theoretical gap in off-policy policy gradient methods.
method Introduced an off-policy policy gradient theorem using emphatic weightings and developed the ACE algorithm.
result Demonstrated ACE finds the optimal solution in off-policy learning, unlike previous methods.
New algorithms improve reinforcement learning stability and performance.
problem Stability issues in TD learning algorithms with function approximation and off-policy sampling.
method Developed and adapted emphatic temporal difference (ETD( λ λ λ )) algorithms for deep reinforcement learning. result Demonstrated improved performance in Atari games and small problems.
Unified reinforcement learning objective improves policy performance prediction.
problem Improving policy performance prediction in reinforcement learning.
method Proposed a counterfactual objective and an emphatic approach to compute unbiased policy gradients.
result Geoff-PAC algorithm demonstrates empirical success in deep RL benchmarks.
Recently, \citet{SuttonMW15} introduced the emphatic temporal differences (ETD) algorithm for off-policy evaluation in Markov decision processes. In this short note, we show that the projected fixed-point equation that underlies ETD involves a contraction operator, with a γ \sqrtγ γ -contraction modulus (where γ γ γ is the …
We consider the off-policy evaluation problem in Markov decision processes with function approximation. We propose a generalization of the recently introduced \emph{emphatic temporal differences} (ETD) algorithm \citep{SuttonMW15}, which encompasses the original ETD( λ λ λ ), as well as several other off-policy evaluation …
PER-ETD improves ETD by reducing variance to polynomial complexity.
problem Large variance in ETD leading to exponential sample complexity.
method Periodically restart and update the follow-on trace for a finite period.
result PER-ETD converges to the same fixed point as ETD but with improved sample complexity.
COF-PAC converges with novel critic and learning method.
problem Convergent off-policy actor-critic with function approximation.
method Two-timescale approach with Gradient Emphasis Learning (GEM).
result First provably convergent COF-PAC with linear critics and nonlinear actor.
Neural networks and linear systems linked, revealing training loss and kernel limitations.
problem Exploring the training loss and limitations of neural networks and their kernels.
method Drawing connections between neural networks and under-determined linear systems, providing lower bounds, and analyzing gradient descent.
result Zero training loss achievable for neural networks under certain conditions, but not for ReLU kernels.
Temporal difference learning and Residual Gradient methods are the most widely used temporal difference based learning algorithms; however, it has been shown that none of their objective functions is optimal w.r.t approximating the true value function V V V . Two novel algorithms are proposed to approximate the true value…
This paper studies users' perception regarding a controversial product, namely self-driving (autonomous) cars. To find people's opinion regarding this new technology, we used an annotated Twitter dataset, and extracted the topics in positive and negative tweets using an unsupervised, probabilistic model known as topic …
The evaluation of machine learning algorithms in biomedical fields for applications involving sequential data lacks standardization. Common quantitative scalar evaluation metrics such as sensitivity and specificity can often be misleading depending on the requirements of the application. Evaluation metrics must ultimat…
For a 3-manifold M, McMullen derived from the Alexander polynomial of M a norm on H^1(M, R) called the Alexander norm. He showed that the Thurston norm on H^1(M, R), which measures the complexity of a dual surface, is an upper bound for the Alexander norm. He asked if these two norms were equal on all of H^1(M,R) when …
New algorithms improve policy evaluation in reinforcement learning.
problem Off-policy stability and on-policy efficiency issues in policy evaluation.
method Introduced novel algorithms using oblique projection method.
result Demonstrated both off-policy stability and on-policy efficiency.
Paper develops a new multi-agent reinforcement learning algorithm.
problem Improving policies in a network of communicating agents.
method Develops a multi-agent off-policy actor-critic algorithm using emphatic temporal difference learning.
result Proves convergence of the algorithm under linear function approximation.
The problem of on-line off-policy evaluation (OPE) has been actively studied in the last decade due to its importance both as a stand-alone problem and as a module in a policy improvement scheme. However, most Temporal Difference (TD) based solutions ignore the discrepancy between the stationary distribution of the beh…
A new weighted MCC measure improves classifier performance evaluation.
problem Lack of measures sensitive to observation weights in multiclass classification.
method Proposes weighted versions of Pearson-Matthews Correlation Coefficient (MCC) for binary and multiclass classification.
result Weighted MCC values are higher for classifiers that perform better on highly weighted observations.
Stability of weighted extremal manifolds proven through blowups.
problem Stability of weighted extremal manifolds.
method Blowup technique to analyze weighted extremal Kähler manifolds.
result Proves weighted extremal manifolds are relatively weighted K-polystable.
Develops theory of weightings for Lie groupoids and algebroids.
problem Understanding differential geometry of weightings for Lie groupoids and algebroids.
method Extending work on weighted manifolds, defining weighted submanifolds, and developing theories of linear weightings and multiplicative weightings.
result Characterizes infinitesimally multiplicative weightings for Lie algebroids and classifies multiplicative weightings of Lie groupoids.
The paper extends spin geometry to weighted manifolds and defines a new mass for Ricci flow.
problem Generalizing spin geometry to weighted manifolds and defining a new mass.
method Investigates spectral properties of the weighted Dirac operator and defines a new mass.
result Defines a new mass for weighted asymptotically Euclidean manifolds and shows its monotonicity under Ricci flow.
Paper generalizes CR Obata theorem to weighted Sasakian manifolds.
problem Deriving eigenvalue estimates for weighted Kohn Laplacian.
method Derived weighted CR Reilly's formula and applied to Sasakian manifolds.
result CR Obata theorem proven for weighted Sasakian manifolds.
The study explores weightings on submanifolds and their geometric properties.
problem Understanding weightings on submanifolds and their geometric implications.
method Detailed exploration of weighted normal bundles, weighted deformation spaces, and weighted blow-ups.
result A description of weightings in terms of subbundles of higher tangent bundles, leading to new concepts for Lie algebroids and groupoids.
New mass and staticity concepts derived from weighted curvature maps.
problem Deriving mass and staticity concepts for weighted manifolds.
method Developed a weighted curvature map and its adjoint, leading to weighted mass and static metrics.
result Equivalence and uniqueness theorems for weighted static manifolds and Penrose inequality.
Proves existence and uniqueness of weighted metrics for smooth spaces.
problem Existence and uniqueness of weighted metrics for smooth metric measure spaces.
method Proves existence and uniqueness using weighted ambient metrics and Poincaré metrics.
result Existence and uniqueness of weighted metrics for smooth metric measure spaces.
Defines and proves properties of weighted renormalized volume coefficients.
problem None explicitly stated; focuses on mathematical definitions and proofs.
method Defines weighted renormalized volume coefficients and proves their variational nature and polynomial representation.
result Weighted renormalized volume coefficients are variational and can be expressed as polynomials of specific tensors.
A new weighted FDA method improves face recognition accuracy.
problem Equal treatment of all class pairs in FDA leads to suboptimal performance.
method Cosine-weighted and automatically weighted FDA methods are proposed.
result Improved face recognition accuracy through weighted FDA.
New invariants help solve existence of weighted cscK metrics.
problem Existence of weighted cscK metrics in K-stability.
method Introduced weighted analytic delta invariant and beta invariant.
result Sufficient condition for existence of weighted cscK metrics.
Proves positive mass theorem for non-spin weighted manifolds.
problem Proving the positive mass theorem for non-spin weighted manifolds.
method Establishing density theorem and generalizing Geroch conjecture.
result Proves positive weighted mass theorem for non-spin weighted manifolds.
Derives integral formulae on weighted manifolds.
problem No specific problem stated; focuses on mathematical derivations.
method Introduces weighted mean sigma-r curvature and uses weighted Newton transformations.
result Derives integral formulae generalizing previous work.
Method measures weight similarity in neural networks using normalization and statistical inference.
problem Quantifying weight similarity in non-convex neural networks.
method Chain normalization rule and hypothesis-training-testing statistical inference.
result Weights of identical neural networks converge to similar local solutions.
The paper studies weighted Ricci curvatures and characterizes Randers metrics.
problem Characterizing Randers metrics with weighted Ricci curvatures.
method General weighted Ricci curvatures and characterization of Randers metrics.
result Characterization of Randers metrics with almost isotropic weighted Ricci curvatures.
Study on stable minimal hypersurfaces under Ricci curvature constraints.
problem Stability of weighted minimal hypersurfaces under Ricci curvature bounds.
method Derive geometric consequences and prove a Schoen-Yau type criterion.
result Structure theorem for three-dimensional weighted manifolds of non-negative Ricci curvature.
The paper classifies vertices in weighted networks using spectral embedding and edge weight distributions.
problem Classifying vertices in weighted networks where edge weights and adjacencies encode class membership.
method Introduced a edge weight distribution matrix to the K-Block Stochastic Block Model for weighted networks. Developed classification procedures based on spectral embedding of the unweighted adjacency matrix under two assumptions on edge weight distributions.
result Proposed classifiers outperform quadratic discriminant analysis on transformed weighted networks.
Explains weightings along submanifolds, focusing on Lie groupoids.
problem None explicitly stated; focuses on theory review.
method Reviews basic notions and emphasizes multiplicative weightings.
result Provides a comprehensive overview of weightings along submanifolds.
The study establishes comparison theorems for weighted Finsler manifolds and spacetimes.
problem Analyzing weighted Finsler manifolds and spacetimes with curvature conditions.
method Using weight function and ε ε ε -range, the Bonnet-Myers theorem, Laplacian comparison theorem, and Bishop-Gromov volume comparison theorem are formulated. result New comparison theorems for weighted Finsler manifolds and spacetimes are derived, including those for weighted Riemannian manifolds.
A new method compresses deep neural networks by predicting and quantizing weights between layers.
problem Resource constraints in deep neural networks.
method Inter-Layer Weight Prediction (ILWP) and quantization based on Smoothly Varying Weight Hypothesis (SVWH).
result The method achieves higher weight compression rates at the same accuracy level.
The study analyzes weighted manifolds with curvature bounds, proving eigenvalue estimates and inequalities.
problem Analyzing geometric properties of weighted manifolds under Ricci curvature bounds.
method Develops geometric analysis techniques on weighted Riemannian manifolds with lower 0 0 0 -weighted Ricci curvature bounds. result Proves eigenvalue estimates for Steklov and ABP inequalities on weighted manifolds.
The paper generalizes K-stability results to singular and weighted settings.
problem Generalizing K-stability to singular and weighted settings.
method Generalization of results in \cite{Li22a} to singular and weighted settings.
result The \(\mathbb{G}\)-uniform weighted K-stability for models implies \(\mathbb{G}\)-coercivity of the weighted Mabuchi functional.
Adaptive learning of sample weights for better model performance.
problem Overfitting to biased training data with corrupted labels or class imbalance.
method Adaptive learning of an explicit weighting function using a meta-weight-net.
result Improves model accuracy in class imbalance and noisy label cases.
Study on deformation of weighted scalar curvature, proving geometric results and stability.
problem Deformation of weighted scalar curvature and related geometric properties.
method Linearization of weighted scalar curvature, studying kernel of formal adjoint.
result Definition and study of weighted vacuum static spaces, stability results on flat spaces.
This paper reviews weighted clustering ensemble methods.
problem Improving clustering results from individual methods.
method Different types of weights and approaches to determining weight values.
result Unified framework for selecting appropriate weighting mechanisms.
New algorithms avoid weight transport, outperforming current deep learning methods.
problem Current deep learning algorithms rely on weight transport, which is biologically implausible.
method Two mechanisms: weight mirror and modified Kolen-Pollack algorithm, using random feedback weights.
result These mechanisms outperform feedback alignment and other methods on visual recognition tasks.
Reverse-weighted portfolios outperform in commodity futures markets.
problem Efficiency of commodity futures markets.
method Permutation-weighted portfolios, rank-based methods.
result Reverse-weighted portfolio outperforms price-weighted portfolio.
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.
Paper extends trigonometric summation formula with weights.
problem Trigonometric summation formula by Grigor'yan, Lin and Yau.
method Weighted trigonometric summation formula derivation.
result Extension of trigonometric summation formula.
A new method to improve deep neural networks using weight rescaling.
problem Overfitting and sensitivity to hyperparameters in weight decay.
method Weight rescaling (WRS) to control weight norm and prevent overfitting.
result WRS outperforms weight decay and other methods in various applications.
A new method trains deep networks by separating weight locations from values.
problem Training deep networks efficiently and effectively.
method Lookahead Permutation (LaPerm) to train DNNs by reconnecting weights.
result LaPerm can train DNNs with random and dense, sparse, or single-valued initial weights.
The paper compares isoperimetric quotients and capacities in weighted manifolds.
problem Comparing isoperimetric quotients and capacities in weighted manifolds.
method Analysis of weighted Laplacian of the distance function and techniques for non-compact submanifolds.
result Parabolicity and hyperbolicity criteria for weighted manifolds.