We establish continuous maximal regularity results for parabolic differential operators acting on sections of tensor bundles on Riemannian manifolds. As an application, we show that solutions to the Yamabe flow instantaneously regularize and become real analytic in space and time. The regularity result is obtained by i…
Maximal regularity for nonuniformly parabolic problems with normal degeneration.
problem Nonuniformly parabolic boundary value problems with degeneration in normal direction.
method Theory of linear parabolic differential equations on noncompact Riemannian manifolds.
result Optimal solution theory for natural degeneration case.
New technique prevents Q-learning collapse by maximizing diversity among ensembles.
problem Value function collapse in ensemble Q-learning.
method Maximizing representation diversity through regularization.
result Regularized approach significantly outperforms existing methods.
Scalable methods for maximizing regularized submodular functions with improved memory and communication complexity.
problem Maximizing submodular functions with negative values and constraints.
method Developed one-pass streaming and distributed algorithms for maximizing regularized submodular functions.
result Improved memory and communication complexity by a factor of O(1/ε) compared to existing work.
We prove that pseudo-holomorphic discs attached to a maximal totally real submanifold inherit their regularity from the regularity of the submanifold and of the almost complex structure. The proof is based on the computation of an explicit lower bound for the Kobayashi metric in almost complex manifolds, which also yie…
A fast geometric regularizer improves event camera performance.
problem Event collapse in contrast maximization framework.
method Geometric regularizer to mitigate overfitting.
result State-of-the-art accuracy with reduced computational complexity.
Extends elliptic operator regularity to maximally hypoelliptic operators.
problem Maximally hypoelliptic differential operators and their regularity.
method Define a principal symbol for arbitrary differential operators involving vector fields and their commutators.
result Proves the invertibility of the principal symbol is equivalent to maximally hypoellipticity, answering a conjecture.
This work proposes SDI regularization to improve adversarial robustness.
problem Improving adversarial robustness of deep neural networks.
method SDI regularization term to complement adversarial training.
result Combining SDI with AT variants enhances robustness and generalization.
Unified regularization framework for visualizing CNNs.
problem Visualizing concepts learned by convolutional neural networks.
method Mathematical framework unifying regularization methods, Sobolev gradients.
result Sobolev filters provide sharper reconstructions and better control over scales.
This work improves policy optimization by maximizing entropy of state distribution, leading to better exploration.
problem Lack of exploration in state space when maximizing policy entropy.
method Proposes maximizing the entropy of a lower bound approximation to the state weighting distribution, based on latent space representation.
result Entropy regularization based on marginal state distribution achieves superior state space coverage and better performance in various domains.
We prove that any minimal (maximal) strongly regular surface in the three-dimensional Minkowski space locally admits canonical principal parameters. Using this result, we find a canonical representation of minimal strongly regular time-like surfaces, which makes more precise the Weierstrass representation and shows mor…
Researchers found a regular language for maximal lexicographic representatives in braid monoids.
problem Understanding the language of maximal lexicographic representatives in braid monoids.
method Detailed description of the smallest Finite State Automaton and analysis of the proportion of elements.
result The proportion of elements of length k whose maximal lexicographic representative finishes with the first generator tends to a number P_{n,1} ≥ 1/8 as k tends to infinity.
Optimizes eigenvalues on surfaces with symmetries.
problem Maximizing Laplace and Steklov eigenvalues on Riemann surfaces with symmetries.
method Simplifies existing techniques for conformal class optimization.
result Proves existence and regularity of maximizers for Laplace and Steklov eigenvalues.
The paper defines function spaces on manifolds with bounded or singular geometries.
problem Defining function spaces on manifolds with various geometries.
method Introduces and analyzes Sobolev, Besov, and Bessel potential spaces on uniformly regular and singular Riemannian manifolds.
result Demonstrates maximal regularity for a linear parabolic problem on singular manifolds.
Method introduces topological regularization using information filtering networks.
problem Sparse probabilistic modeling and multicollinear regression.
method Topological regularization via information filtering network.
result Direct application to L 0 L_0 L 0 -norm regularized problems. Proves properties of maximal hypersurfaces in specific spacetimes.
problem Maximal hypersurfaces in asymptotically AdS spacetimes.
method Uniqueness, existence, and regularity results via mathematical proofs.
result Proves uniqueness, existence, and regularity of maximal hypersurfaces.
The paper proposes effective margin regularization to improve adversarial robustness in deep neural networks.
problem Adversarial vulnerability of deep neural networks (DNNs).
method Regularization of effective weight norm during training to maximize effective margins.
result Effective margin regularization (EMR) boosts adversarial robustness in both standard and adversarial training.
CPR adds entropy maximization to improve continual learning methods.
problem Catastrophic forgetting in continual learning.
method Classifier-Projection Regularization (CPR) adds an entropy maximization term to existing regularization methods.
result CPR improves accuracy and plasticity in continual learning methods.
Maximal correlation framework improves fairness in machine learning algorithms.
problem Ensuring fairness in machine learning algorithms.
method Introducing maximal correlation framework for fairness constraints and deriving regularizers.
result The approach provides smooth performance-fairness tradeoff curves and competitive performance.
Study finds metrics maximizing one Laplace eigenvalue on 3D and higher manifolds.
problem Maximizing a Laplace eigenvalue on n-dimensional manifolds.
method Existence and regularity results for metrics of same volume in a conformal class.
result Existence and regularity of metrics maximizing the Laplace eigenvalue.
Paper studies Einstein vacuum equations with low regularity data.
problem Einstein vacuum equations with low regularity initial data.
method Combines Klainerman-Szeftel-Rodnianski curvature theorem, Czimek's extension procedure, and global elliptic estimates.
result Time of existence controlled by low regularity bounds on curvature in L 2 L^2 L 2 . Maximal metric spheres found, related to Sobolev-to-Lipschitz property.
problem Finding maximal metric spheres.
method Characterizing maximal spheres by Sobolev-to-Lipschitz property.
result Maximal spheres uniquely characterized by Sobolev-to-Lipschitz property.
We construct low regularity solutions of the vacuum Einstein constraint equations. In particular, on 3-manifolds we obtain solutions with metrics in $H^s\loc$ with s > 3 2 s>{3\over 2} s > 2 3 . The theory of maximal asymptotically Euclidean solutions of the constraint equations descends completely the low regularity setting. Moreove…
Paper proposes a new algorithm for AUC maximization.
problem Maximizing AUC in imbalanced classification and anomaly detection.
method Stochastic proximal algorithm for AUC maximization.
result High-probability convergence rate of O(1/√T) for general convex setting.
By a theorem of Banyaga the group of diffeomorphisms of a manifold P P P preserving a regular contact form α α α is a central S 1 S^1 S 1 extension of the commutator of the group of symplectomorphisms of the base B = P / S 1 B = P/S^1 B = P / S 1 . We show that if T T T is a Hamiltonian maximal torus in the group of symplectomorphism of B B B , then its pr…
Regularized EM algorithm improves clustering performance with small sample sizes.
problem Performance reduction in EM algorithm due to small sample size and poorly conditioned covariance matrices.
method Regularized EM algorithm that uses prior knowledge to ensure positive definiteness of covariance matrices.
result The regularized EM algorithm outperforms standard EM in clustering tasks with small sample sizes.
Proposes a framework to maximize mutual information in VAE models for better latent code representation.
problem Lack of explicit measurement of the quality of learned representations in VAE models.
method Variational Mutual Information Maximization Framework for VAE.
result Maximizes mutual information between latent codes and observations, improving latent code representation.
The ratio of volume to crossing number of a hyperbolic knot is known to be bounded above by the volume of a regular ideal octahedron, and a similar bound is conjectured for the knot determinant per crossing. We investigate a natural question motivated by these bounds: For which knots are these ratios nearly maximal? We…
This paper optimizes revenue and resource balance in network revenue management.
problem Maximizing revenue while ensuring fair resource consumption across different suppliers.
method Introduces a regularized revenue objective and a primal-dual UCB algorithm for continuous prices and balancing.
result Achieves a worst-case regret of O ~ ( N 5 / 2 T ) \widetilde O(N^{5/2}\sqrt{T}) O ( N 5/2 T ) for revenue maximization and balancing. Enhances method for constructing integral manifolds of non-integrable Pfaffian systems.
problem Constructing maximal integral manifolds for non-integrable Pfaffian systems.
method Recurrent geometrical method developed by Élie Cartan and von Weber.
result Enhanced Jordan-Hölder integration procedure for constructing local maximal integral manifolds.
Proposes a novel graph self-training method with EM regularization for semi-supervised node classification.
problem Handles noisy graph structures and feature spaces in semi-supervised node classification.
method Introduces an Expectation-Maximization (EM) regularization scheme for uncertainty-aware pseudo-label generation and model retraining.
result Significantly outperforms strong baselines by up to 2.5% in accuracy.
A method connects KDE to sparse mixture models with adaptive regularization.
problem Estimating Gaussian mixture models from sparse data.
method Generalized expectation-maximization method with adaptive regularization.
result Sparse mixture models retain details from adaptive KDE.
We consider a stochastic optimal control problem in a market model with temporary and permanent price impact, which is related to an expected utility maximization problem under finite fuel constraint. We establish the initial condition fulfilled by the corresponding value function and show its first regularity property…
GPMD solves regularized RL with linear convergence, promoting structural policies.
problem Regularized reinforcement learning to encourage exploration and structural policies.
method Policy mirror descent with generalized convex regularizers and Bregman divergence.
result GPMD converges linearly to the global solution over a wide range of learning rates.
QAInfomax improves reading comprehension by maximizing mutual information, achieving state-of-the-art performance.
problem Distractor sentences in question answering datasets are hard to distinguish from relevant ones.
method QAInfomax regularizes reading comprehension models to learn mutual information among passages, questions, and answers.
result QAInfomax achieves state-of-the-art performance on Adversarial-SQuAD dataset.
New proof for convex solutions of Monge-Ampère equation.
problem Interior regularity of strictly convex solutions
method Doubling inequality for Hessian in extrinsic distance function
result Interior regularity established
Study how regularization and optimization affect margin in deep models.
problem Understanding margin maximization in deep learning models.
method Analyze the limit of loss minimization with diverging norm constraints and margin paths.
result Discovers lexicographic max-margin solutions for homogeneous models and shows convergence under certain conditions.
We demonstrate that almost all non-parametric dimensionality reduction methods can be expressed by a simple procedure: regularized loss minimization plus singular value truncation. By distinguishing the role of the loss and regularizer in such a process, we recover a factored perspective that reveals some gaps in the c…
Maximizing energy on flexible curves yields regular or convex polygons.
problem Finding the shape of a flexible curve that maximizes a given energy function.
method Analyzing the energy function and properties of flexible curves.
result Maximizers are regular or convex n-gons, with each edge of length 1.
New method learns adaptive exploration strategies for dynamic tasks.
problem Learning effective exploration strategies in changing environments.
method Informed policy regularization to reduce sample complexity of RNN-based policies.
result Method learns efficient exploration strategies balancing information gathering and reward maximization.
Solves Deligne-Simpson problem for special connections on Gm.
problem Existence of Fuchsian connections with specific singularities.
method Theory of fundamental and regular strata, lattice chain filtration, quiver varieties.
result Characterization of rigid connections with unipotent monodromy at infinity.
The Yamabe flow preserves conical singularities under certain conditions.
problem Preserving conical singularities under the Yamabe flow.
method Using maximal L q L^q L q -regularity theory for conically degenerate operators. result Asymptotic expansion of the evolving metric near conical tips.
This paper addresses the problem of sparsity penalized least squares for applications in sparse signal processing, e.g. sparse deconvolution. This paper aims to induce sparsity more strongly than L1 norm regularization, while avoiding non-convex optimization. For this purpose, this paper describes the design and use of…
We consider a geometrically finite discrete group of conformal transformations of the sphere. Further we consider distributions which are supported on the limit set and are invariant with conformal weight. We estimate their regularity in terms of the conformal weight, the Hausdorff dimension of the limit set, and the m…
The paper defines a new coordinate system for anti-de Sitter structures.
problem Understanding the geometry of anti-de Sitter spaces.
method Combining recent work on anti-de Sitter structures with classical theory.
result Introduced a coordinate system resembling Fenchel-Nielsen coordinates.
Jacobian regularization boosts neural network robustness without degrading generalization.
problem Ensuring robustness of machine learning models against input perturbations.
method Developed a computationally efficient Jacobian regularization technique.
result Significant improvements in robustness measured against random and adversarial perturbations.
Choquet regularization improves exploration in RL.
problem Improving exploration in reinforcement learning.
method Introducing Choquet regularizers to measure and manage exploration, reformulating RL problems and deriving explicit solutions.
result Explicit optimal distributions and Choquet regularizers for various exploratory samplers.
Proves Gannon-Lee theorem for C 1 C^1 C 1 spacetimes.
problem Classical singularity theorems for C 1 C^1 C 1 spacetimes. method Proves theorem for C 1 C^1 C 1 spacetimes, shows geodesic properties. result Gannon-Lee theorem holds for C 1 C^1 C 1 spacetimes.