ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1309.5977
  4. Cited By
Efficient Sampling from Time-Varying Log-Concave Distributions

Efficient Sampling from Time-Varying Log-Concave Distributions

23 September 2013
Hariharan Narayanan
Alexander Rakhlin
ArXiv (abs)PDFHTML

Papers citing "Efficient Sampling from Time-Varying Log-Concave Distributions"

13 / 13 papers shown
Title
Faster Sampling from Log-Concave Densities over Polytopes via Efficient
  Linear Solvers
Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers
Oren Mangoubi
Nisheeth K. Vishnoi
28
0
0
06 Sep 2024
Fast sampling from constrained spaces using the Metropolis-adjusted
  Mirror Langevin algorithm
Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm
Vishwak Srinivasan
Andre Wibisono
Ashia Wilson
78
7
0
14 Dec 2023
First- and Second-Order Bounds for Adversarial Linear Contextual Bandits
First- and Second-Order Bounds for Adversarial Linear Contextual Bandits
Julia Olkhovskaya
J. Mayo
T. Erven
Gergely Neu
Chen-Yu Wei
90
11
0
01 May 2023
Sampling from Log-Concave Distributions over Polytopes via a
  Soft-Threshold Dikin Walk
Sampling from Log-Concave Distributions over Polytopes via a Soft-Threshold Dikin Walk
Oren Mangoubi
Nisheeth K. Vishnoi
119
2
0
19 Jun 2022
Damped Online Newton Step for Portfolio Selection
Damped Online Newton Step for Portfolio Selection
Zakaria Mhammedi
Alexander Rakhlin
60
15
0
15 Feb 2022
Sampling from Log-Concave Distributions with Infinity-Distance
  Guarantees
Sampling from Log-Concave Distributions with Infinity-Distance Guarantees
Oren Mangoubi
Nisheeth K. Vishnoi
83
15
0
07 Nov 2021
Embedded training of neural-network sub-grid-scale turbulence models
Embedded training of neural-network sub-grid-scale turbulence models
J. MacArt
Justin A. Sirignano
Jonathan B Freund
106
48
0
03 May 2021
Online Sampling from Log-Concave Distributions
Online Sampling from Log-Concave Distributions
Holden Lee
Oren Mangoubi
Nisheeth K. Vishnoi
56
3
0
21 Feb 2019
Contextual bandits with surrogate losses: Margin bounds and efficient
  algorithms
Contextual bandits with surrogate losses: Margin bounds and efficient algorithms
Dylan J. Foster
A. Krishnamurthy
167
18
0
28 Jun 2018
Logistic Regression: The Importance of Being Improper
Logistic Regression: The Importance of Being Improper
Dylan J. Foster
Satyen Kale
Haipeng Luo
M. Mohri
Karthik Sridharan
81
78
0
25 Mar 2018
The Many Faces of Exponential Weights in Online Learning
The Many Faces of Exponential Weights in Online Learning
Dirk van der Hoeven
T. Erven
W. Kotłowski
OffRL
92
50
0
21 Feb 2018
Fast MCMC sampling algorithms on polytopes
Fast MCMC sampling algorithms on polytopes
Yuansi Chen
Raaz Dwivedi
Martin J. Wainwright
Bin Yu
59
68
0
23 Oct 2017
Sampling normalizing constants in high dimensions using inhomogeneous
  diffusions
Sampling normalizing constants in high dimensions using inhomogeneous diffusions
Christophe Andrieu
James Ridgway
N. Whiteley
48
10
0
22 Dec 2016
1