Paper proposes a CNN for speech emotion recognition using center loss and reconstruction.
problem Speech emotion recognition (SER) in audio signals.
method Convolutional Neural Network (CNN) with center loss and reconstruction as regularizers.
result Proposed method achieves highly discriminative features for SER.
Optimal weight windows are symmetric rectangles centered at peak.
problem Finding the best weight windows for weighted least squares.
method Investigated symmetric and tapered rectangle window weights, showing the best rectangle window is optimal.
result The best rectangle window is optimal for all tapered rectangle window definitions.
New quantile methods improve uncertainty quantification across various models.
problem Improper quantile loss limits model flexibility and accuracy.
method Developed new quantile methods that optimize for calibration, sharpness, and centered intervals.
result Improved conditional quantiles and better uncertainty quantification across diverse models.
Previous work shows that adversarially robust generalization requires larger sample complexity, and the same dataset, e.g., CIFAR-10, which enables good standard accuracy may not suffice to train robust models. Since collecting new training data could be costly, we focus on better utilizing the given data by inducing t…
Formulae track evolution of angular momentum and center of mass at null infinity.
problem Tracking the evolution of conserved quantities at null infinity.
method Evolution formulae in Bondi-Sachs coordinates, expressed in terms of shear and news tensors.
result Supertranslation invariance of fluxes, conservation law of angular momentum, duality paradigm.
A new method for federated survival analysis using Cox models.
problem Non-separability of Cox PH model loss function in federated learning.
method Discrete-time Cox model, separable loss function, federated learning.
result Improved performance and communication efficiency compared to previous methods.
With the remarkable success achieved by the Convolutional Neural Networks (CNNs) in object recognition recently, deep learning is being widely used in the computer vision community. Deep Metric Learning (DML), integrating deep learning with conventional metric learning, has set new records in many fields, especially in…
Paper tackles catastrophic forgetting in incremental learning with improved cosine distance and PEDCC-Loss.
problem Tackles catastrophic forgetting in incremental learning.
method Ensemble method based on cosine distance and PEDCC-Loss.
result Outperforms recent methods in preserving old knowledge while learning new classes.
In this article, we consider the limit of quasi-local conserved quantities [31,9] at the infinity of an asymptotically hyperbolic initial data set in general relativity. These give notions of total energy-momentum, angular momentum, and center of mass. Our assumption on the asymptotics is less stringent than any previo…
Paper proposes self-supervised method for accurate speaker diarization.
problem Speaker diarization without massive labeling effort.
method Introduces dynamic triplet loss and multinomial loss for audio-video synchronization.
result Best model yields +8% F1-score improvement and diarization error rate reduction.
Optimal weight windows are found by projecting the origin onto a convex polytope.
problem Finding the best weight windows for a weighted moving average smoother.
method Formulated as a quadratic program and projection onto a convex polytope.
result Optimal weight windows are symmetrical and decrease in weight away from the center.
Improved speech enhancement using diffusion models with MSE loss.
problem Efficient incorporation of noisy speech in generative speech enhancement.
method Augmented diffusion-based generative model with a MSE loss for enhanced speech.
result Proposed method improves speech enhancement performance compared to original diffusion model.
Gradient-based clustering method for various cost functions.
problem Distance-based clustering for various cost functions.
method Iterative alternating update procedure for cluster assignments and centers.
result Converges to fixed points under mild assumptions.
Study compares metric learning loss functions for speaker verification.
problem Comparing metric learning loss functions for end-to-end speaker verification.
method Cross entropy loss, cosine loss, angular margin loss, center loss, contrastive loss, triplet loss.
result Additive angular margin loss outperforms other loss functions.
DADC algorithm improves clustering for data with varying density.
problem Sparse cluster loss and cluster fragmentation in density peak clustering.
method Domain-adaptive density measurement, cluster center self-identification, and cluster self-ensemble.
result DADC achieves more reasonable clustering results on data with varying density.
Hurricanes are cyclones circulating about a defined center whose closed wind speeds exceed 75 mph originating over tropical and subtropical waters. At landfall, hurricanes can result in severe disasters. The accuracy of predicting their trajectory paths is critical to reduce economic loss and save human lives. Given th…
A new method predicts electron density accurately from atom-centered models.
problem Predicting electron density accurately from atom-centered models.
method Gradient-based approach to minimize loss function in an optimized sparse feature space.
result Extremely accurate predictions of electron density and total energies.
Bayesian framework tackles measurement error in covariates.
problem Misleading inference due to corrupted covariates.
method Bayesian Nonparametric Learning framework robust to misspecification.
result General framework for Classical and Berkson error models.
A novel k-means method for MNAR data improves clustering accuracy.
problem Improving k-means clustering for data missing not at random.
method A magnitude-decaying MNAR scenario-based k-means method with size constraints.
result The method reduces bias in estimated cluster centers and improves clustering accuracy.
Proposes a probabilistic framework for smart contract risk quantification.
problem Quantifying financial risk of smart contract cyber attacks and failures.
method Probabilistic graph-theoretical framework using bond percolation models.
result Analytical results and numerical examples for aggregate loss distribution.
A new method centers outliers in robust PCA without manual intervention.
problem Outliers in robust PCA require manual centering, complicating the analysis.
method Introduces a 'bias trick' to automatically center non-outliers.
result First optimal RPCA algorithm with automatic centering.
Deep neural networks improve free energy calculations for peptide conformations.
problem Challenges in developing suitable mappings for free energy perturbation.
method Adapted machine learning approach to train deep neural networks for mapping between Boltzmann distributions.
result Accurate free energy differences calculated between thermodynamic states with spring centers separated by 1 Å and sometimes 2 Å.
Center identified in stated skein algebra for quantum traces.
problem Understanding the center of the stated skein algebra.
method Analyzing the algebra as a generalization of Kauffman bracket skein algebra, focusing on the case when the quantum parameter is a root of unity.
result Simple description and dimension calculation of the center over the center module.
The object of our investigation is a point that gives the maximum value of a potential with a strictly decreasing radially symmetric kernel. It defines a center of a body in Rm. When we choose the Riesz kernel or the Poisson kernel as the kernel, such centers are called a radial center or an illuminating center, respec…
We study the problem of training deep neural networks with Rectified Linear Unit (ReLU) activation function using gradient descent and stochastic gradient descent. In particular, we study the binary classification problem and show that for a broad family of loss functions, with proper random weight initialization, both…
Refines geometric center of mass analysis for Einstein field equations.
problem Analyzing the geometric center of mass of Willmore surfaces in initial data for Einstein field equations.
method Refined Lyapunov-Schmidt analysis to study geometric center of mass of area-constrained Willmore surfaces.
result The geometric center of mass agrees with the Hamiltonian center of mass under specific conditions.
COMRADE is a communication-efficient, Byzantine-resilient second-order optimization algorithm.
problem Byzantine failures in distributed optimization.
method COMRADE is a communication-efficient, second-order optimization algorithm that uses a simple norm-based thresholding rule to filter out Byzantine workers.
result COMRADE achieves linear-quadratic convergence and is robust against Byzantine workers.
A new portfolio model considers investor aversion to loss and risk.
problem Constructing a robust portfolio under uncertain asset returns and investor aversion.
method Distributional robust optimization (DRP) with a Wasserstein ball centered on empirical distribution, mixed-integer quadratic programming, and hybrid algorithm.
result Empirical testing shows superior performance in asset allocation compared to common strategies.
Let f:M->M be a partially hyperbolic diffeomorphism such that all of its center leaves are compact. We prove that Sullivan's example of a circle foliation that has arbitrary long leaves cannot be the center foliation of f. This is proved by thorough study of the accessible boundaries of the center-stable and the center…
In this paper, we made an extension to the convergence analysis of the dynamics of two-layered bias-free networks with one ReLU output. We took into consideration two popular regularization terms: the ℓ1 and ℓ2 norm of the parameter vector w, and added it to the square loss function with coefficient $λ/…
We investigate centers of a body (the closure of a bounded open set) defined as maximum points of potentials. In particular, we study centers defined by the Riesz potential and by Poisson's integral. These centers, in general, depend on parameters and move with respect to the parameters. We give a necessary and suffici…
We prove the existence of a center, or continuous selection of a point, in the relative interior of C1 embedded k-disks in Riemannian n-manifolds. If k≤3 the center can be made equivariant with respect to the isometries of the manifold, and under mild assumptions the same holds for k=4=n. By contrast, for…
This work analyzes centered binary Restricted Boltzmann Machines (RBMs) and binary Deep Boltzmann Machines (DBMs), where centering is done by subtracting offset values from visible and hidden variables. We show analytically that (i) centering results in a different but equivalent parameterization for artificial neural …
A standard introduction to online learning might place Online Gradient Descent at its center and then proceed to develop generalizations and extensions like Online Mirror Descent and second-order methods. Here we explore the alternative approach of putting Exponential Weights (EW) first. We show that many standard meth…
The paper quantizes concatenated noisy vectors to a common cluster center, improving performance over naive methods.
problem Clustering concatenated noisy vectors from multiple sources.
method Asymptotic analysis of weighted sum of distances to a common cluster center.
result The clustering approach outperforms naive methods in terms of average distortion.
In this study, we investigate the locus of the centers of the Meusnier spheres. Just as focal curve is the locus of the centers of the osculating spheres, we investigate the geometrical interpretation on the locus of the centers of the Meusnier spheres. We proved that if the curve is a principal line, the locus of the …
This article briefly introduced Arthur and Vassilvitshii's work on \textbf{k-means++} algorithm and further generalized the center initialization process. It is found that choosing the most distant sample point from the nearest center as new center can mostly have the same effect as the center initialization process in…
The determination of cluster centers generally depends on the scale that we use to analyze the data to be clustered. Inappropriate scale usually leads to unreasonable cluster centers and thus unreasonable results. In this study, we first consider the similarity of elements in the data as the connectivity of nodes in an…
The paper introduces group-representative clustering to ensure fair representation of different groups in clusters.
problem Ensuring fair representation of different groups in clusters.
method Developed a new clustering approach called group-representative clustering, which parallels fairness notions in classification.
result Presented approximation algorithms for group representative k-median clustering and evaluated on real-world data. Absolutely partially hyperbolic surface endomorphisms have a coherent center foliation.
problem Understanding the dynamics of absolutely partially hyperbolic surface endomorphisms.
method Showed the existence of a center foliation and leaf conjugacy to the linearization.
result Absolutely partially hyperbolic surface endomorphisms have a dynamically coherent center foliation.
Suppose one is faced with the challenge of tissue segmentation in MR images, without annotators at their center to provide labeled training data. One option is to go to another medical center for a trained classifier. Sadly, tissue classifiers do not generalize well across centers due to voxel intensity shifts caused b…
Introduces Quantum Data Center for quantum era benefits.
problem No specific problem stated; focuses on future potential.
method Combines QRAM and quantum networks.
result QDC offers efficiency, security, and precision.
Unified theory linking atom-centered and message-passing models for molecular properties.
problem Combining atom-centered and message-passing models for accurate molecular property prediction.
method Generalizing ACDC framework to include multi-centered information, providing a complete linear basis for regression.
result Unified understanding of atom-centered and message-passing models, providing a coherent foundation.
Characterizes G2-structures on Lie algebras with non-trivial center.
problem Classifying Lie algebras with G2-structures.
method Analyzing Lie algebras with non-trivial center, using contactization and symplectic properties.
result Six unimodular Lie algebras with non-trivial center admit closed G2-structures.
Paper introduces new center of mass for flat manifolds.
problem Defining center of mass for asymptotically flat manifolds.
method Using double forms of Kulkarni and Labbi to prove existence and well-definedness.
result Existence and well-definedness of the Gauss-Bonnet-Chern center of mass.
Simplified proof of mass center system's uniqueness and generalized Pappus' theorem across Euclidean, spherical, and hyperbolic geometries.
problem Proving the uniqueness of the mass center system in non-Euclidean geometries and deriving a generalized Pappus' theorem.
method Revisiting and simplifying G.A. Galperin's proof, extending the mass center system to manifolds, and deriving a generalized Pappus' theorem.
result Unified and simpler proofs for Pappus' theorem in Euclidean, spherical, and hyperbolic geometries.
A new method uses local sensitivity to improve importance sampling for approximating complex loss functions.
problem Approximating complex loss functions using subsampling with strong theoretical guarantees.
method Introducing local sensitivity to measure data point importance and using leverage scores for efficient estimation.
result Local sensitivity sampling can be efficiently estimated and used to approximate complex loss functions with strong guarantees.
New features for quantum calculations learn N-center Hamiltonian matrix elements.
problem Quantum calculations need features for N-center Hamiltonians, not just atom-centered ones.
method Developed fully equivariant N-center features for machine learning.
result Learned matrix elements of N-center Hamiltonians efficiently.